{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M7XRMFDLJSMD3QQF3VVHA7NUY6","short_pith_number":"pith:M7XRMFDL","schema_version":"1.0","canonical_sha256":"67ef16146b4c983dc205dd6a707db4c79a6d89c4501ba27441c837aa507febe8","source":{"kind":"arxiv","id":"1401.2499","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.2499","created_at":"2026-05-18T03:02:33.343577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2499v1","created_at":"2026-05-18T03:02:33.343577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2499","created_at":"2026-05-18T03:02:33.343577+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7XRMFDLJSMD","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7XRMFDLJSMD3QQF","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7XRMFDL","created_at":"2026-05-18T12:28:38.356838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6","json":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6.json","graph_json":"https://pith.science/api/pith-number/M7XRMFDLJSMD3QQF3VVHA7NUY6/graph.json","events_json":"https://pith.science/api/pith-number/M7XRMFDLJSMD3QQF3VVHA7NUY6/events.json","paper":"https://pith.science/paper/M7XRMFDL"},"agent_actions":{"view_html":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6","download_json":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6.json","view_paper":"https://pith.science/paper/M7XRMFDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2499&json=true","fetch_graph":"https://pith.science/api/pith-number/M7XRMFDLJSMD3QQF3VVHA7NUY6/graph.json","fetch_events":"https://pith.science/api/pith-number/M7XRMFDLJSMD3QQF3VVHA7NUY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/action/storage_attestation","attest_author":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/action/author_attestation","sign_citation":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/action/citation_signature","submit_replication":"https://pith.science/pith/M7XRMFDLJSMD3QQF3VVHA7NUY6/action/replication_record"}},"created_at":"2026-05-18T03:02:33.343577+00:00","updated_at":"2026-05-18T03:02:33.343577+00:00"}