{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:MV4AX6I2PNYH6QJOUBCMSHX3XE","short_pith_number":"pith:MV4AX6I2","schema_version":"1.0","canonical_sha256":"65780bf91a7b707f412ea044c91efbb9055693aba5d4b9e513da85e99d3e4236","source":{"kind":"arxiv","id":"math/9411222","version":1},"attestation_state":"computed","paper":{"title":"The complexity of broadcasting in bounded-degree networks","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Michael J. Dinneen","submitted_at":"1994-11-18T00:00:00Z","abstract_excerpt":"Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where each call requires a unit of time and a call can involve only two nodes. We show that for bounded-degree networks determining the minimum broadcast time from an originating node remains NP-complete."},"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":"math/9411222","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-11-18T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"90e6e1a85fff837cd4d454bba5687da9d0a7b849aba4a77e494ae64b1839424e","abstract_canon_sha256":"395382e71a8fe0c8658a906d138114b5d1857f003a595c50f8b596121319daf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.855113Z","signature_b64":"F2atkX+TzPONXgIPRxnkQJrlfmud6kvnMafJHacwQhPG5RRV2Tn7SnTd2I731YLfxapp6sRrkCS2o5n3vuvhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65780bf91a7b707f412ea044c91efbb9055693aba5d4b9e513da85e99d3e4236","last_reissued_at":"2026-05-18T01:05:50.854601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.854601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of broadcasting in bounded-degree networks","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Michael J. Dinneen","submitted_at":"1994-11-18T00:00:00Z","abstract_excerpt":"Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where each call requires a unit of time and a call can involve only two nodes. We show that for bounded-degree networks determining the minimum broadcast time from an originating node remains NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9411222","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":"math/9411222","created_at":"2026-05-18T01:05:50.854685+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9411222v1","created_at":"2026-05-18T01:05:50.854685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9411222","created_at":"2026-05-18T01:05:50.854685+00:00"},{"alias_kind":"pith_short_12","alias_value":"MV4AX6I2PNYH","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"MV4AX6I2PNYH6QJO","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"MV4AX6I2","created_at":"2026-05-18T12:25:47.102015+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/MV4AX6I2PNYH6QJOUBCMSHX3XE","json":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE.json","graph_json":"https://pith.science/api/pith-number/MV4AX6I2PNYH6QJOUBCMSHX3XE/graph.json","events_json":"https://pith.science/api/pith-number/MV4AX6I2PNYH6QJOUBCMSHX3XE/events.json","paper":"https://pith.science/paper/MV4AX6I2"},"agent_actions":{"view_html":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE","download_json":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE.json","view_paper":"https://pith.science/paper/MV4AX6I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9411222&json=true","fetch_graph":"https://pith.science/api/pith-number/MV4AX6I2PNYH6QJOUBCMSHX3XE/graph.json","fetch_events":"https://pith.science/api/pith-number/MV4AX6I2PNYH6QJOUBCMSHX3XE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE/action/storage_attestation","attest_author":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE/action/author_attestation","sign_citation":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE/action/citation_signature","submit_replication":"https://pith.science/pith/MV4AX6I2PNYH6QJOUBCMSHX3XE/action/replication_record"}},"created_at":"2026-05-18T01:05:50.854685+00:00","updated_at":"2026-05-18T01:05:50.854685+00:00"}