{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RGOO7BJYF7DVPFEBSOIQGCWJGW","short_pith_number":"pith:RGOO7BJY","schema_version":"1.0","canonical_sha256":"899cef85382fc75794819391030ac935b8c69a65ca7e1fa2ae143b5900df1c1f","source":{"kind":"arxiv","id":"1601.03225","version":1},"attestation_state":"computed","paper":{"title":"Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Davide Frey, Hicham Lakhlef, Michel Raynal","submitted_at":"2016-01-13T13:13:49Z","abstract_excerpt":"This article is on message-passing systems where communication is (a) synchronous and (b) based on the \"broadcast/receive\" pair of communication operations. \"Synchronous\" means that time is discrete and appears as a sequence of time slots (or rounds) such that each message is received in the very same round in which it is sent. \"Broadcast/receive\" means that during a round a process can either broadcast a message to its neighbors or receive a message from one of them. In such a communication model, no two neighbors of the same process, nor a process and any of its neighbors, must be allowed to"},"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":"1601.03225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-13T13:13:49Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"90f784e13028d33f2f8b91dc0a0d6ae46f5701b4d836ff176277a03ee848f236","abstract_canon_sha256":"01940c61666e437eac17f07c7fdf9701b912fe394dcd8b632beba46537881695"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:55.056891Z","signature_b64":"gHDxYuVGxCCS8hIts/TyIR3doyYO9kvr31iLtV4q2qzae9lpAToqTfsBqEgWDjzjv8tOYNd6iWIhtMrhghGACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899cef85382fc75794819391030ac935b8c69a65ca7e1fa2ae143b5900df1c1f","last_reissued_at":"2026-05-18T01:22:55.056407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:55.056407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Collision/Conflict-free Distance-2 Coloring in Synchronous Broadcast/Receive Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Davide Frey, Hicham Lakhlef, Michel Raynal","submitted_at":"2016-01-13T13:13:49Z","abstract_excerpt":"This article is on message-passing systems where communication is (a) synchronous and (b) based on the \"broadcast/receive\" pair of communication operations. \"Synchronous\" means that time is discrete and appears as a sequence of time slots (or rounds) such that each message is received in the very same round in which it is sent. \"Broadcast/receive\" means that during a round a process can either broadcast a message to its neighbors or receive a message from one of them. In such a communication model, no two neighbors of the same process, nor a process and any of its neighbors, must be allowed to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03225","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":"1601.03225","created_at":"2026-05-18T01:22:55.056490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.03225v1","created_at":"2026-05-18T01:22:55.056490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03225","created_at":"2026-05-18T01:22:55.056490+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGOO7BJYF7DV","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGOO7BJYF7DVPFEB","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGOO7BJY","created_at":"2026-05-18T12:30:41.710351+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/RGOO7BJYF7DVPFEBSOIQGCWJGW","json":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW.json","graph_json":"https://pith.science/api/pith-number/RGOO7BJYF7DVPFEBSOIQGCWJGW/graph.json","events_json":"https://pith.science/api/pith-number/RGOO7BJYF7DVPFEBSOIQGCWJGW/events.json","paper":"https://pith.science/paper/RGOO7BJY"},"agent_actions":{"view_html":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW","download_json":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW.json","view_paper":"https://pith.science/paper/RGOO7BJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.03225&json=true","fetch_graph":"https://pith.science/api/pith-number/RGOO7BJYF7DVPFEBSOIQGCWJGW/graph.json","fetch_events":"https://pith.science/api/pith-number/RGOO7BJYF7DVPFEBSOIQGCWJGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW/action/storage_attestation","attest_author":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW/action/author_attestation","sign_citation":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW/action/citation_signature","submit_replication":"https://pith.science/pith/RGOO7BJYF7DVPFEBSOIQGCWJGW/action/replication_record"}},"created_at":"2026-05-18T01:22:55.056490+00:00","updated_at":"2026-05-18T01:22:55.056490+00:00"}