{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QLKBCXI5IIYGAWJ7WDA4PJZ5V7","short_pith_number":"pith:QLKBCXI5","schema_version":"1.0","canonical_sha256":"82d4115d1d423060593fb0c1c7a73daff88f4f4cfef459ee72ee84552a4d7c85","source":{"kind":"arxiv","id":"1801.00365","version":1},"attestation_state":"computed","paper":{"title":"Broadcasting Spanning Forests on a Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Karol Golab","submitted_at":"2017-12-31T22:20:46Z","abstract_excerpt":"The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are distributed among the processors, with each edge held by one processor.\n  The underlying broadcast network is implemented as a multiple-access channel. If exactly one processor attempts to perform a broadcast, then the broadcast is successful. A"},"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":"1801.00365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T22:20:46Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"82b82dbbce36a4fc3ce8abab6740fbcbdba3647a9d94eac4261ad1a8da26c24b","abstract_canon_sha256":"c51f84baa37ae32d745178bfe61cde77867e838c95aa4f5a45871ef3e89517cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:58.554368Z","signature_b64":"kVu0EsaOr7E0FL3n5bZUDWo/yp01uM+nQpNH35QMnASOt+RM9lZ61ZrAZDDc1oES7AE4ExCF2vOWW3LsDOo9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82d4115d1d423060593fb0c1c7a73daff88f4f4cfef459ee72ee84552a4d7c85","last_reissued_at":"2026-05-18T00:26:58.553698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:58.553698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcasting Spanning Forests on a Multiple-Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DS","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Karol Golab","submitted_at":"2017-12-31T22:20:46Z","abstract_excerpt":"The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting. The output consists of the edges that make a spanning forest and have been broadcast on the network. Input edges are distributed among the processors, with each edge held by one processor.\n  The underlying broadcast network is implemented as a multiple-access channel. If exactly one processor attempts to perform a broadcast, then the broadcast is successful. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00365","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":"1801.00365","created_at":"2026-05-18T00:26:58.553784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00365v1","created_at":"2026-05-18T00:26:58.553784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00365","created_at":"2026-05-18T00:26:58.553784+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLKBCXI5IIYG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLKBCXI5IIYGAWJ7","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLKBCXI5","created_at":"2026-05-18T12:31:39.905425+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/QLKBCXI5IIYGAWJ7WDA4PJZ5V7","json":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7.json","graph_json":"https://pith.science/api/pith-number/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/graph.json","events_json":"https://pith.science/api/pith-number/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/events.json","paper":"https://pith.science/paper/QLKBCXI5"},"agent_actions":{"view_html":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7","download_json":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7.json","view_paper":"https://pith.science/paper/QLKBCXI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00365&json=true","fetch_graph":"https://pith.science/api/pith-number/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/graph.json","fetch_events":"https://pith.science/api/pith-number/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/action/storage_attestation","attest_author":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/action/author_attestation","sign_citation":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/action/citation_signature","submit_replication":"https://pith.science/pith/QLKBCXI5IIYGAWJ7WDA4PJZ5V7/action/replication_record"}},"created_at":"2026-05-18T00:26:58.553784+00:00","updated_at":"2026-05-18T00:26:58.553784+00:00"}