{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZMQZR2Q3CZPECG4QZQQA3IHIWX","short_pith_number":"pith:ZMQZR2Q3","canonical_record":{"source":{"id":"1712.00150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T01:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"186eee9a355093d4d0c074f206c60cfe5ef9f3a93ca69b8e08bea7ca29833fc9","abstract_canon_sha256":"44db278e232ae77c1b0873bfe6bb0388017010c77aedb8eb8072218bd31ea824"},"schema_version":"1.0"},"canonical_sha256":"cb2198ea1b165e411b90cc200da0e8b5eae0a3959e278695c51f7b529746e7fa","source":{"kind":"arxiv","id":"1712.00150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00150","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00150v1","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00150","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZMQZR2Q3CZPE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMQZR2Q3CZPECG4Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMQZR2Q3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZMQZR2Q3CZPECG4QZQQA3IHIWX","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T01:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"186eee9a355093d4d0c074f206c60cfe5ef9f3a93ca69b8e08bea7ca29833fc9","abstract_canon_sha256":"44db278e232ae77c1b0873bfe6bb0388017010c77aedb8eb8072218bd31ea824"},"schema_version":"1.0"},"canonical_sha256":"cb2198ea1b165e411b90cc200da0e8b5eae0a3959e278695c51f7b529746e7fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:07.166630Z","signature_b64":"giXJy8v/L79Ar3vrV2ZJYwyf2UgbX4kky71ng4x7/T+BrtmaTR2S6XlnCwXcCsVo9os78q+z/SbZrvXwq/YHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2198ea1b165e411b90cc200da0e8b5eae0a3959e278695c51f7b529746e7fa","last_reissued_at":"2026-05-18T00:29:07.165965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:07.165965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00150","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-18T00:29:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdrOpS2PlvV46RbXQBl8Y0tXxrHW1ItqZiR1JjTV0xG0kkzJk2WUiKAQGcy/3im/wMOqPyBje4H1HxncblK2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:51:17.780595Z"},"content_sha256":"5de2aaa0f4624dd555073af21749c5aeb3949f07423d313d050c206edf69dd57","schema_version":"1.0","event_id":"sha256:5de2aaa0f4624dd555073af21749c5aeb3949f07423d313d050c206edf69dd57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZMQZR2Q3CZPECG4QZQQA3IHIWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing upper bounds for optimal density of $(t,r)$ broadcasts on the infinite grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph","submitted_at":"2017-12-01T01:54:01Z","abstract_excerpt":"The domination number of a finite graph $G$ with vertex set $V$ is the cardinality of the smallest set $S\\subseteq V$ such that for every vertex $v\\in V$ either $v\\in S$ or $v$ is adjacent to a vertex in $S$. A set $S$ satisfying these conditions is called a dominating set. In 2015 Blessing, Insko, Johnson, and Mauretour introduced $(t,r)$ broadcast domination, a generalization of graph domination parameterized by the nonnegative integers $t$ and $r$. In this setting, we say that the signal a vertex $v\\in V$ receives from a tower of strength $t$ located at vertex $T$ is defined by $sig(v,T)=ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00150","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-18T00:29:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4LfNt0Bb4067LZ8Q6AuI3kaRrmWZE+5osYpS266ZJ8Gh9tfwtQAFyuBKFnoBBMR91XSxwVg7Xo6tp9cTbgrVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:51:17.780944Z"},"content_sha256":"7e5349429f2eefc5e685b14713c13fed71fe73a866295e99ba57856d05f0731e","schema_version":"1.0","event_id":"sha256:7e5349429f2eefc5e685b14713c13fed71fe73a866295e99ba57856d05f0731e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/bundle.json","state_url":"https://pith.science/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/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-05-28T10:51:17Z","links":{"resolver":"https://pith.science/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX","bundle":"https://pith.science/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/bundle.json","state":"https://pith.science/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMQZR2Q3CZPECG4QZQQA3IHIWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZMQZR2Q3CZPECG4QZQQA3IHIWX","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":"44db278e232ae77c1b0873bfe6bb0388017010c77aedb8eb8072218bd31ea824","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T01:54:01Z","title_canon_sha256":"186eee9a355093d4d0c074f206c60cfe5ef9f3a93ca69b8e08bea7ca29833fc9"},"schema_version":"1.0","source":{"id":"1712.00150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00150","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00150v1","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00150","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZMQZR2Q3CZPE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMQZR2Q3CZPECG4Q","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMQZR2Q3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:7e5349429f2eefc5e685b14713c13fed71fe73a866295e99ba57856d05f0731e","target":"graph","created_at":"2026-05-18T00:29:07Z","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 finite graph $G$ with vertex set $V$ is the cardinality of the smallest set $S\\subseteq V$ such that for every vertex $v\\in V$ either $v\\in S$ or $v$ is adjacent to a vertex in $S$. A set $S$ satisfying these conditions is called a dominating set. In 2015 Blessing, Insko, Johnson, and Mauretour introduced $(t,r)$ broadcast domination, a generalization of graph domination parameterized by the nonnegative integers $t$ and $r$. In this setting, we say that the signal a vertex $v\\in V$ receives from a tower of strength $t$ located at vertex $T$ is defined by $sig(v,T)=ma","authors_text":"Benjamin F. Drews, Pamela E. Harris, Timothy W. Randolph","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T01:54:01Z","title":"Computing upper bounds for optimal density of $(t,r)$ broadcasts on the infinite grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00150","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:5de2aaa0f4624dd555073af21749c5aeb3949f07423d313d050c206edf69dd57","target":"record","created_at":"2026-05-18T00:29:07Z","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":"44db278e232ae77c1b0873bfe6bb0388017010c77aedb8eb8072218bd31ea824","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T01:54:01Z","title_canon_sha256":"186eee9a355093d4d0c074f206c60cfe5ef9f3a93ca69b8e08bea7ca29833fc9"},"schema_version":"1.0","source":{"id":"1712.00150","kind":"arxiv","version":1}},"canonical_sha256":"cb2198ea1b165e411b90cc200da0e8b5eae0a3959e278695c51f7b529746e7fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb2198ea1b165e411b90cc200da0e8b5eae0a3959e278695c51f7b529746e7fa","first_computed_at":"2026-05-18T00:29:07.165965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:07.165965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"giXJy8v/L79Ar3vrV2ZJYwyf2UgbX4kky71ng4x7/T+BrtmaTR2S6XlnCwXcCsVo9os78q+z/SbZrvXwq/YHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:07.166630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5de2aaa0f4624dd555073af21749c5aeb3949f07423d313d050c206edf69dd57","sha256:7e5349429f2eefc5e685b14713c13fed71fe73a866295e99ba57856d05f0731e"],"state_sha256":"4642b4d1aac8fe994e50a3af8db591834f3722cd3293c722f64e6fab839ffc39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKF8NdD5uTKC/i9R7osEox9alyoHeI7pOdsMBhNu3W4dbcr07/v3R4pb5bM0d5lXrU1pwZ5EaJ5WguMcGNo1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:51:17.783063Z","bundle_sha256":"2082eab0ff5195b397bb72de1723c690f7fa38582bcc78fa60a1a3e45d8c9143"}}