{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PA3HNSOADOMR4OASQZYHDSMLIZ","short_pith_number":"pith:PA3HNSOA","schema_version":"1.0","canonical_sha256":"783676c9c01b991e3812867071c98b465b1ef7d6ad3f542196c2f4308438d2a9","source":{"kind":"arxiv","id":"2501.02380","version":9},"attestation_state":"computed","paper":{"title":"Reciprocating Locks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Kogan, Dave Dice","submitted_at":"2025-01-04T20:59:34Z","abstract_excerpt":"We present \"Reciprocating Locks\", a novel mutual exclusion locking algorithm, targeting cache-coherent shared memory (CC), that enjoys a number of desirable properties. The doorway arrival phase and the release operation both run in constant-time. Waiting threads use local spinning and only a single waiting element is required per thread, regardless of the number of locks a thread might hold at a given time. While our lock does not provide strict FIFO admission, it bounds bypass and has strong anti-starvation properties. The lock is compact, space efficient, and has been intentionally designed"},"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":"2501.02380","kind":"arxiv","version":9},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-01-04T20:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"7a48665d816506fa8c2cd5860479b595574afda53a93f6821643859abe01d54a","abstract_canon_sha256":"1dfd3744ff9aaaa808ce4a8bebe39d6399e991f7f4b83f4634325959f0f1066a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:31.649548Z","signature_b64":"qMLrhSgf7/lh/t+6Dtv/7EHQ8itvVYPXIzhzqwpTjk3R3AFlLQ7aKYw8j2MbsRLwJObPuCdacFwluI7pQXLoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"783676c9c01b991e3812867071c98b465b1ef7d6ad3f542196c2f4308438d2a9","last_reissued_at":"2026-07-05T11:35:31.648999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:31.648999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reciprocating Locks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alex Kogan, Dave Dice","submitted_at":"2025-01-04T20:59:34Z","abstract_excerpt":"We present \"Reciprocating Locks\", a novel mutual exclusion locking algorithm, targeting cache-coherent shared memory (CC), that enjoys a number of desirable properties. The doorway arrival phase and the release operation both run in constant-time. Waiting threads use local spinning and only a single waiting element is required per thread, regardless of the number of locks a thread might hold at a given time. While our lock does not provide strict FIFO admission, it bounds bypass and has strong anti-starvation properties. The lock is compact, space efficient, and has been intentionally designed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02380","kind":"arxiv","version":9},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.02380/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.02380","created_at":"2026-07-05T11:35:31.649068+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.02380v9","created_at":"2026-07-05T11:35:31.649068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02380","created_at":"2026-07-05T11:35:31.649068+00:00"},{"alias_kind":"pith_short_12","alias_value":"PA3HNSOADOMR","created_at":"2026-07-05T11:35:31.649068+00:00"},{"alias_kind":"pith_short_16","alias_value":"PA3HNSOADOMR4OAS","created_at":"2026-07-05T11:35:31.649068+00:00"},{"alias_kind":"pith_short_8","alias_value":"PA3HNSOA","created_at":"2026-07-05T11:35:31.649068+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/PA3HNSOADOMR4OASQZYHDSMLIZ","json":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ.json","graph_json":"https://pith.science/api/pith-number/PA3HNSOADOMR4OASQZYHDSMLIZ/graph.json","events_json":"https://pith.science/api/pith-number/PA3HNSOADOMR4OASQZYHDSMLIZ/events.json","paper":"https://pith.science/paper/PA3HNSOA"},"agent_actions":{"view_html":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ","download_json":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ.json","view_paper":"https://pith.science/paper/PA3HNSOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.02380&json=true","fetch_graph":"https://pith.science/api/pith-number/PA3HNSOADOMR4OASQZYHDSMLIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PA3HNSOADOMR4OASQZYHDSMLIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ/action/storage_attestation","attest_author":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ/action/author_attestation","sign_citation":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ/action/citation_signature","submit_replication":"https://pith.science/pith/PA3HNSOADOMR4OASQZYHDSMLIZ/action/replication_record"}},"created_at":"2026-07-05T11:35:31.649068+00:00","updated_at":"2026-07-05T11:35:31.649068+00:00"}