{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M7XRMFDLJSMD3QQF3VVHA7NUY6","short_pith_number":"pith:M7XRMFDL","canonical_record":{"source":{"id":"1401.2499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-11T03:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"8a25c0034f7f10632f86f23a7988ecc28d20eafcecc589784a3f13cdd7fc5652","abstract_canon_sha256":"e716c6b7512eb3c81ec0a92300a0708ec53262530f13c7694cee019aaacff889"},"schema_version":"1.0"},"canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","source":{"kind":"arxiv","id":"1401.2499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2499","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2499v1","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2499","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"M7XRMFDLJSMD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M7XRMFDLJSMD3QQF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M7XRMFDL","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M7XRMFDLJSMD3QQF3VVHA7NUY6","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-11T03:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"8a25c0034f7f10632f86f23a7988ecc28d20eafcecc589784a3f13cdd7fc5652","abstract_canon_sha256":"e716c6b7512eb3c81ec0a92300a0708ec53262530f13c7694cee019aaacff889"},"schema_version":"1.0"},"canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:33.344387Z","signature_b64":"TWAAMPqKxWYFcjCflLKHHVCJ/gWdU9xQyN6JINwnGdPoRtGoxa9lO6DAFJePQ2MxfCPPgCOWVIhBWGkjn3NmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","last_reissued_at":"2026-05-18T03:02:33.343436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:33.343436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2499","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dg4aaZ7pzB3yu08scuvARzEJwTGENWu4789e8AOEIh/9EQiCdDsFISUkFqpva+aKedorLea1kZLD5odjFd+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:16:27.137829Z"},"content_sha256":"5c576da97d37d3b3a91a85eed1245aa1dd38254c0a4df18ae16e888b34b22cf6","schema_version":"1.0","event_id":"sha256:5c576da97d37d3b3a91a85eed1245aa1dd38254c0a4df18ae16e888b34b22cf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M7XRMFDLJSMD3QQF3VVHA7NUY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On (t,r) Broadcast Domination Numbers of Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christie Mauretour, David Blessing, Erik Insko, Katie Johnson","submitted_at":"2014-01-11T03:38:35Z","abstract_excerpt":"The domination number of a graph $G = (V,E)$ is the minimum cardinality of any subset $S \\subset V$ such that every vertex in $V$ is in $S$ or adjacent to an element of $S$. Finding the domination numbers of $m$ by $n$ grids was an open problem for nearly 30 years and was finally solved in 2011 by Goncalves, Pinlou, Rao, and Thomass\\'e. Many variants of domination number on graphs have been defined and studied, but exact values have not yet been obtained for grids. We will define a family of domination theories parameterized by pairs of positive integers $(t,r)$ where $1 \\leq r \\leq t$ which g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2499","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:02:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1RxM30wZOvGV3IXILhKZDHe0RAA7hb1vJeJ4q5vYvfQnHx3u+l5MRUNi7HLHxLNVyhh2SY8T7cIgae5QLhJgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:16:27.138153Z"},"content_sha256":"2282dfb930b3ed9a0dcbdbdf7b0e282c4fba817127e484b6eab4c1b6989fb193","schema_version":"1.0","event_id":"sha256:2282dfb930b3ed9a0dcbdbdf7b0e282c4fba817127e484b6eab4c1b6989fb193"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/bundle.json","state_url":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T19:16:27Z","links":{"resolver":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6","bundle":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/bundle.json","state":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M7XRMFDLJSMD3QQF3VVHA7NUY6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e716c6b7512eb3c81ec0a92300a0708ec53262530f13c7694cee019aaacff889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-11T03:38:35Z","title_canon_sha256":"8a25c0034f7f10632f86f23a7988ecc28d20eafcecc589784a3f13cdd7fc5652"},"schema_version":"1.0","source":{"id":"1401.2499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2499","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2499v1","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2499","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"M7XRMFDLJSMD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M7XRMFDLJSMD3QQF","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M7XRMFDL","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2282dfb930b3ed9a0dcbdbdf7b0e282c4fba817127e484b6eab4c1b6989fb193","target":"graph","created_at":"2026-05-18T03:02:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The domination number of a graph $G = (V,E)$ is the minimum cardinality of any subset $S \\subset V$ such that every vertex in $V$ is in $S$ or adjacent to an element of $S$. Finding the domination numbers of $m$ by $n$ grids was an open problem for nearly 30 years and was finally solved in 2011 by Goncalves, Pinlou, Rao, and Thomass\\'e. Many variants of domination number on graphs have been defined and studied, but exact values have not yet been obtained for grids. We will define a family of domination theories parameterized by pairs of positive integers $(t,r)$ where $1 \\leq r \\leq t$ which g","authors_text":"Christie Mauretour, David Blessing, Erik Insko, Katie Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-11T03:38:35Z","title":"On (t,r) Broadcast Domination Numbers of Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2499","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c576da97d37d3b3a91a85eed1245aa1dd38254c0a4df18ae16e888b34b22cf6","target":"record","created_at":"2026-05-18T03:02:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e716c6b7512eb3c81ec0a92300a0708ec53262530f13c7694cee019aaacff889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-11T03:38:35Z","title_canon_sha256":"8a25c0034f7f10632f86f23a7988ecc28d20eafcecc589784a3f13cdd7fc5652"},"schema_version":"1.0","source":{"id":"1401.2499","kind":"arxiv","version":1}},"canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","first_computed_at":"2026-05-18T03:02:33.343436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:33.343436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TWAAMPqKxWYFcjCflLKHHVCJ/gWdU9xQyN6JINwnGdPoRtGoxa9lO6DAFJePQ2MxfCPPgCOWVIhBWGkjn3NmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:33.344387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c576da97d37d3b3a91a85eed1245aa1dd38254c0a4df18ae16e888b34b22cf6","sha256:2282dfb930b3ed9a0dcbdbdf7b0e282c4fba817127e484b6eab4c1b6989fb193"],"state_sha256":"1e9e1669cd48044f4b2be6579bafad91d4cfe927bd71fe3819c7b4714fec1319"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BZOG3eh2RJdj1LxbiYUntHccSGazHKUYbT4ktOp/e79+z0uUX0uri9k8r1010TimJQmW7BxKi837Tn+yJcMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:16:27.139917Z","bundle_sha256":"7adf2dd12b3d5ae10c73d3b439a4ea6787ac41394b285feaca190b4328042043"}}