{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CFXHUVEJJL4MTOW2ZFGE5N7OJW","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":"6b897ff3ce5755cf241726a450e930009d41a5ea9f80a6dc897fab31d6f4d2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T21:53:41Z","title_canon_sha256":"aef9e826b3ad3975e84423a1d80cfe13cc2e567bde84df9edb860819c430817a"},"schema_version":"1.0","source":{"id":"1908.06189","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06189","created_at":"2026-07-05T07:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06189v2","created_at":"2026-07-05T07:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06189","created_at":"2026-07-05T07:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"CFXHUVEJJL4M","created_at":"2026-07-05T07:25:35Z"},{"alias_kind":"pith_short_16","alias_value":"CFXHUVEJJL4MTOW2","created_at":"2026-07-05T07:25:35Z"},{"alias_kind":"pith_short_8","alias_value":"CFXHUVEJ","created_at":"2026-07-05T07:25:35Z"}],"graph_snapshots":[{"event_id":"sha256:816b3a2d177c22c478ed1c73c22a74f0b6cc985474b6a69caeef11d2732babcd","target":"graph","created_at":"2026-07-05T07:25:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=( V(G), E(G) )$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. We say a subset $D$ of $V(G)$ dominates $G$ if every vertex in $V \\setminus D$ is adjacent to a vertex in $D$. A generalization of this concept is $(t,r)$ broadcast domination. We designate certain vertices to be towers of signal strength $t$, which send out signal to neighboring vertices with signal strength decaying linearly as the signal traverses the edges of the graph. We let $\\mathbb{T}$ be the set of all towers, and we define the signal received by a vertex $v\\in V(G)$ from a tower $w \\in \\mathbb T$ ","authors_text":"Alexandro Vasquez, Gordon Rojas Kirby, Joseph Rennie, Marissa Loving, Natasha Crepeau, Pamela E. Harris, Sean Hays","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T21:53:41Z","title":"On $(t,r)$ broadcast domination of certain grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06189","kind":"arxiv","version":2},"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:95a444d4cd772d97d29f3edcc438a8a7743ee151d9df5d06555ad7f786827134","target":"record","created_at":"2026-07-05T07:25:35Z","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":"6b897ff3ce5755cf241726a450e930009d41a5ea9f80a6dc897fab31d6f4d2cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T21:53:41Z","title_canon_sha256":"aef9e826b3ad3975e84423a1d80cfe13cc2e567bde84df9edb860819c430817a"},"schema_version":"1.0","source":{"id":"1908.06189","kind":"arxiv","version":2}},"canonical_sha256":"116e7a54894af8c9badac94c4eb7ee4d899704f4887f6cb5c3fbba970b9d9bfd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"116e7a54894af8c9badac94c4eb7ee4d899704f4887f6cb5c3fbba970b9d9bfd","first_computed_at":"2026-07-05T07:25:35.229513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:25:35.229513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BBwSY5/K4/y46kCXHXPldBSFXScY2lbb7ZPcfdMoz8S8kf8j956TfOgnbTKOA4QCkxtJfEnlrC/9pMfBUNpjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:25:35.230063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06189","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a444d4cd772d97d29f3edcc438a8a7743ee151d9df5d06555ad7f786827134","sha256:816b3a2d177c22c478ed1c73c22a74f0b6cc985474b6a69caeef11d2732babcd"],"state_sha256":"b4eb97901a26889f8799ada21cb88031c66bc328c6eee223c36222c36a676d3d"}