{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FYGSQHHJW6GFAIYHJCCH2OWFOW","short_pith_number":"pith:FYGSQHHJ","schema_version":"1.0","canonical_sha256":"2e0d281ce9b78c50230748847d3ac57595e0610d1d2a509dd8a28d8ccc57700a","source":{"kind":"arxiv","id":"1510.00220","version":1},"attestation_state":"computed","paper":{"title":"Fundamental Results for a Generic Implementation of Barriers using Optical Interconnects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eldhose Peter, Preeti Ranjan Panda, Sandeep Chandran, Smruti R. Sarangi","submitted_at":"2015-10-01T13:24:06Z","abstract_excerpt":"In this report, we report some fundamental results and bounds on the number of messages and storage required to implement barriers using futuristic on-chip optical and RF networks. We prove that it is necessary to maintain a count to at least N (number of threads) in memory, broadcast the barrier id at least once, and if we elect a co-ordinator, we can reduce the number of messages by a factor of O(N )."},"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":"1510.00220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-01T13:24:06Z","cross_cats_sorted":[],"title_canon_sha256":"6843064653dbc2cb067c362a68fd0b69c50f2c4bf5159f1d6515b79d671d78b4","abstract_canon_sha256":"0de3f38c67d6cf6bd1cd1f4f104fa78f332b0f8b56f6fd62fa65f890da42f1de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:20.432504Z","signature_b64":"XIScV0JYkSMGeCvcqP/lfLVIlK8LgVJZe4vj40kNE/CwJNGdasty14I29m6Fm/0k4FAaKZKy4TUxTrpsn4+dCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e0d281ce9b78c50230748847d3ac57595e0610d1d2a509dd8a28d8ccc57700a","last_reissued_at":"2026-05-18T01:31:20.431845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:20.431845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Results for a Generic Implementation of Barriers using Optical Interconnects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eldhose Peter, Preeti Ranjan Panda, Sandeep Chandran, Smruti R. Sarangi","submitted_at":"2015-10-01T13:24:06Z","abstract_excerpt":"In this report, we report some fundamental results and bounds on the number of messages and storage required to implement barriers using futuristic on-chip optical and RF networks. We prove that it is necessary to maintain a count to at least N (number of threads) in memory, broadcast the barrier id at least once, and if we elect a co-ordinator, we can reduce the number of messages by a factor of O(N )."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.00220","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":"1510.00220","created_at":"2026-05-18T01:31:20.431953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.00220v1","created_at":"2026-05-18T01:31:20.431953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.00220","created_at":"2026-05-18T01:31:20.431953+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYGSQHHJW6GF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYGSQHHJW6GFAIYH","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYGSQHHJ","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/FYGSQHHJW6GFAIYHJCCH2OWFOW","json":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW.json","graph_json":"https://pith.science/api/pith-number/FYGSQHHJW6GFAIYHJCCH2OWFOW/graph.json","events_json":"https://pith.science/api/pith-number/FYGSQHHJW6GFAIYHJCCH2OWFOW/events.json","paper":"https://pith.science/paper/FYGSQHHJ"},"agent_actions":{"view_html":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW","download_json":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW.json","view_paper":"https://pith.science/paper/FYGSQHHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.00220&json=true","fetch_graph":"https://pith.science/api/pith-number/FYGSQHHJW6GFAIYHJCCH2OWFOW/graph.json","fetch_events":"https://pith.science/api/pith-number/FYGSQHHJW6GFAIYHJCCH2OWFOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW/action/storage_attestation","attest_author":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW/action/author_attestation","sign_citation":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW/action/citation_signature","submit_replication":"https://pith.science/pith/FYGSQHHJW6GFAIYHJCCH2OWFOW/action/replication_record"}},"created_at":"2026-05-18T01:31:20.431953+00:00","updated_at":"2026-05-18T01:31:20.431953+00:00"}