{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GVQSJA2TBSUAXBC6IBNOHJJ2GP","short_pith_number":"pith:GVQSJA2T","schema_version":"1.0","canonical_sha256":"35612483530ca80b845e405ae3a53a33d45cfb5adb7c0e51d976929657f3e95b","source":{"kind":"arxiv","id":"1504.02491","version":1},"attestation_state":"computed","paper":{"title":"Line-Broadcasting in Complete k-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Revital Hollander Shabtai, Yehuda Roditty","submitted_at":"2015-04-09T20:29:22Z","abstract_excerpt":"A line-broadcasting model in a connected graph $G=(V,E)$, $|V|=n$, is a model in which one vertex, called the {\\it originator} of the broadcast holds a message that has to be transmitted to all vertices of the graph through placement of a series of calls over the graph. In this model, an informed vertex can transmit a message through a path of any length in a single time unit, as long as two transmissions do not use the same edge at the same time. Farley \\cite{f} has shown that the process is completed within at most $\\lceil \\log_{2}n \\rceil$ time units from any originator in a tree (and thus "},"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":"1504.02491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-04-09T20:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"2078da748a2bddf430bc777ff491f7f1f6ecdae98bf37eaea32612d0e4ab4163","abstract_canon_sha256":"5b61fdf5190fe01b01dabaed8f2a91afca96e6b51e4ca3c8cf906aa37f8584a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.540243Z","signature_b64":"fF6ROGsJqdcF20GMchQrIii+7r9PNiL/yX4gIG6tAVCyH39CzMO+f+/vaN7TeMZAalLMQB0S7GK6T5rtSjxfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35612483530ca80b845e405ae3a53a33d45cfb5adb7c0e51d976929657f3e95b","last_reissued_at":"2026-05-18T02:19:07.539580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.539580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line-Broadcasting in Complete k-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Revital Hollander Shabtai, Yehuda Roditty","submitted_at":"2015-04-09T20:29:22Z","abstract_excerpt":"A line-broadcasting model in a connected graph $G=(V,E)$, $|V|=n$, is a model in which one vertex, called the {\\it originator} of the broadcast holds a message that has to be transmitted to all vertices of the graph through placement of a series of calls over the graph. In this model, an informed vertex can transmit a message through a path of any length in a single time unit, as long as two transmissions do not use the same edge at the same time. Farley \\cite{f} has shown that the process is completed within at most $\\lceil \\log_{2}n \\rceil$ time units from any originator in a tree (and thus "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02491","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":"1504.02491","created_at":"2026-05-18T02:19:07.539680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02491v1","created_at":"2026-05-18T02:19:07.539680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02491","created_at":"2026-05-18T02:19:07.539680+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVQSJA2TBSUA","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVQSJA2TBSUAXBC6","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVQSJA2T","created_at":"2026-05-18T12:29:22.688609+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/GVQSJA2TBSUAXBC6IBNOHJJ2GP","json":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP.json","graph_json":"https://pith.science/api/pith-number/GVQSJA2TBSUAXBC6IBNOHJJ2GP/graph.json","events_json":"https://pith.science/api/pith-number/GVQSJA2TBSUAXBC6IBNOHJJ2GP/events.json","paper":"https://pith.science/paper/GVQSJA2T"},"agent_actions":{"view_html":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP","download_json":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP.json","view_paper":"https://pith.science/paper/GVQSJA2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02491&json=true","fetch_graph":"https://pith.science/api/pith-number/GVQSJA2TBSUAXBC6IBNOHJJ2GP/graph.json","fetch_events":"https://pith.science/api/pith-number/GVQSJA2TBSUAXBC6IBNOHJJ2GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP/action/storage_attestation","attest_author":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP/action/author_attestation","sign_citation":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP/action/citation_signature","submit_replication":"https://pith.science/pith/GVQSJA2TBSUAXBC6IBNOHJJ2GP/action/replication_record"}},"created_at":"2026-05-18T02:19:07.539680+00:00","updated_at":"2026-05-18T02:19:07.539680+00:00"}