{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7HHAFYCFROQMLAO2EZUNO5FDC7","short_pith_number":"pith:7HHAFYCF","canonical_record":{"source":{"id":"1610.05250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-17T18:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"e5e64a1854325c3258d9e949d8cfe49fb58e7fe9beb2d76be76d2b1231c55be2","abstract_canon_sha256":"642cc14100078c707c9c03593b95c641b0d5ea809f6ba0148b9f4584eabd0381"},"schema_version":"1.0"},"canonical_sha256":"f9ce02e0458ba0c581da2668d774a317dea54ba1fa6accad510fd4e7f34d96aa","source":{"kind":"arxiv","id":"1610.05250","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05250","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05250v1","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05250","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"7HHAFYCFROQM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HHAFYCFROQMLAO2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HHAFYCF","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7HHAFYCFROQMLAO2EZUNO5FDC7","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05250","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-17T18:27:29Z","cross_cats_sorted":[],"title_canon_sha256":"e5e64a1854325c3258d9e949d8cfe49fb58e7fe9beb2d76be76d2b1231c55be2","abstract_canon_sha256":"642cc14100078c707c9c03593b95c641b0d5ea809f6ba0148b9f4584eabd0381"},"schema_version":"1.0"},"canonical_sha256":"f9ce02e0458ba0c581da2668d774a317dea54ba1fa6accad510fd4e7f34d96aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:05.702944Z","signature_b64":"+2xO9hMHFHzP+Wo0yVLTyDopnwPW2+FLkmg557b/wuiK13qDbHfL2Lvx3aZDlEPQZcZxQu6J4Nt1UsSbaBUZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ce02e0458ba0c581da2668d774a317dea54ba1fa6accad510fd4e7f34d96aa","last_reissued_at":"2026-05-18T01:02:05.702470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:05.702470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05250","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-18T01:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPXY09uuWgQmBrzOFUEzB0Z2PHMKzpb60WDUA8VZboP0t/v2LMYyNhEM41utDW+67FPGKBpN4VKvOpyxLQiIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:30:54.135154Z"},"content_sha256":"f8feb89f86332d930d773dc7e91bcc556783c6f8066d61f43a1af0afe7121f3b","schema_version":"1.0","event_id":"sha256:f8feb89f86332d930d773dc7e91bcc556783c6f8066d61f43a1af0afe7121f3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7HHAFYCFROQMLAO2EZUNO5FDC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper broadcast domination of toroidal grids and a classification of diametrical trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bethany Kubik, Candice Price, Erik Insko","submitted_at":"2016-10-17T18:27:29Z","abstract_excerpt":"A broadcast on a graph $G=(V,E)$ is a function $f:V \\rightarrow \\{0,1, \\ldots, \\text{diam}(G)\\}$ satisfying $f(v) \\leq e(v)$ for all $v \\in V$, where $e(v)$ denotes the eccentricity of $v$ and $\\text{diam}(G)$ denotes the diameter of $G$. We say that a broadcast dominates $G$ if every vertex can hear at least one broadcasting node. The upper domination number is the maximum cost of all possible minimal broadcasts, where the cost of a broadcast is defined as $\\text{cost} (f)= \\sum_{v \\in V}f(v)$. In this paper we establish both the upper domination number and the upper broadcast domination numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05250","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-18T01:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ydyk3yYcgIKNntskHG9AIYoxoD+OVYzCftP/XuBf+o/X5daE7Y9wlMcjgOjo0XvAKuVdT5abvQRJVDERUMXaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:30:54.135517Z"},"content_sha256":"af53c0ef1b69ace9c7f07215f09bb62df66abe25650d6dd26df3b123260d4e87","schema_version":"1.0","event_id":"sha256:af53c0ef1b69ace9c7f07215f09bb62df66abe25650d6dd26df3b123260d4e87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/bundle.json","state_url":"https://pith.science/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/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-28T08:30:54Z","links":{"resolver":"https://pith.science/pith/7HHAFYCFROQMLAO2EZUNO5FDC7","bundle":"https://pith.science/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/bundle.json","state":"https://pith.science/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HHAFYCFROQMLAO2EZUNO5FDC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7HHAFYCFROQMLAO2EZUNO5FDC7","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":"642cc14100078c707c9c03593b95c641b0d5ea809f6ba0148b9f4584eabd0381","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-17T18:27:29Z","title_canon_sha256":"e5e64a1854325c3258d9e949d8cfe49fb58e7fe9beb2d76be76d2b1231c55be2"},"schema_version":"1.0","source":{"id":"1610.05250","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05250","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05250v1","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05250","created_at":"2026-05-18T01:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"7HHAFYCFROQM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HHAFYCFROQMLAO2","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HHAFYCF","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:af53c0ef1b69ace9c7f07215f09bb62df66abe25650d6dd26df3b123260d4e87","target":"graph","created_at":"2026-05-18T01:02:05Z","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":"A broadcast on a graph $G=(V,E)$ is a function $f:V \\rightarrow \\{0,1, \\ldots, \\text{diam}(G)\\}$ satisfying $f(v) \\leq e(v)$ for all $v \\in V$, where $e(v)$ denotes the eccentricity of $v$ and $\\text{diam}(G)$ denotes the diameter of $G$. We say that a broadcast dominates $G$ if every vertex can hear at least one broadcasting node. The upper domination number is the maximum cost of all possible minimal broadcasts, where the cost of a broadcast is defined as $\\text{cost} (f)= \\sum_{v \\in V}f(v)$. In this paper we establish both the upper domination number and the upper broadcast domination numb","authors_text":"Bethany Kubik, Candice Price, Erik Insko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-17T18:27:29Z","title":"Upper broadcast domination of toroidal grids and a classification of diametrical trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05250","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:f8feb89f86332d930d773dc7e91bcc556783c6f8066d61f43a1af0afe7121f3b","target":"record","created_at":"2026-05-18T01:02:05Z","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":"642cc14100078c707c9c03593b95c641b0d5ea809f6ba0148b9f4584eabd0381","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-17T18:27:29Z","title_canon_sha256":"e5e64a1854325c3258d9e949d8cfe49fb58e7fe9beb2d76be76d2b1231c55be2"},"schema_version":"1.0","source":{"id":"1610.05250","kind":"arxiv","version":1}},"canonical_sha256":"f9ce02e0458ba0c581da2668d774a317dea54ba1fa6accad510fd4e7f34d96aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9ce02e0458ba0c581da2668d774a317dea54ba1fa6accad510fd4e7f34d96aa","first_computed_at":"2026-05-18T01:02:05.702470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:05.702470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+2xO9hMHFHzP+Wo0yVLTyDopnwPW2+FLkmg557b/wuiK13qDbHfL2Lvx3aZDlEPQZcZxQu6J4Nt1UsSbaBUZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:05.702944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05250","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8feb89f86332d930d773dc7e91bcc556783c6f8066d61f43a1af0afe7121f3b","sha256:af53c0ef1b69ace9c7f07215f09bb62df66abe25650d6dd26df3b123260d4e87"],"state_sha256":"7025a9572dbc9aa60a508774f0b86a263a740fb51fc8fa87cd5430c89e7e7da2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDM5XapzvngP7YWty9abnmWGrwDuZuqIZUf27kLwCa4BU2oZ2fS85lKidvfWPTLOOuC0m1yTINgYRiF5Jfa9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:30:54.137553Z","bundle_sha256":"626500f470bd0a4182934ac4962ddb3228b5fe895fef93f89ccbbb221332f8a3"}}