{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q6GWEYE4S4BPJ6TYX5GRLZ5CT3","short_pith_number":"pith:Q6GWEYE4","schema_version":"1.0","canonical_sha256":"878d62609c9702f4fa78bf4d15e7a29ee2ce2c36e1213ec43a884048796c8541","source":{"kind":"arxiv","id":"1510.02211","version":1},"attestation_state":"computed","paper":{"title":"The F-snapshot Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Amram","submitted_at":"2015-10-08T07:27:37Z","abstract_excerpt":"Aguilera, Gafni and Lamport introduced the signaling problem in [5]. In this problem, two processes numbered 0 and 1 can call two procedures: update and Fscan. A parameter of the problem is a two- variable function $F(x_0,x_1)$. Each process $p_i$ can assign values to variable $x_i$ by calling update(v) with some data value v, and compute the value: $F(x_0,x_1)$ by executing an Fscan procedure. The problem is interesting when the domain of $F$ is infinite and the range of $F$ is finite. In this case, some \"access restrictions\" are imposed that limit the size of the registers that the Fscan pro"},"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.02211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-08T07:27:37Z","cross_cats_sorted":[],"title_canon_sha256":"746a5ce99e296124c371c9b9c0d3788e7348bfb2c9d9c9339797e4201e088a8f","abstract_canon_sha256":"eff9f9d85c7bd27c5a0b3ec7c0eeca46a9645c1f28be2e8c7134033623ddc76a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:44.457516Z","signature_b64":"OjfnYO9OqvnlMxIoRskjYPhSn/cqEnhYl5mjCuQIJEX9lEh3Exc7tG30LgbOcNr/b6JsuAMQUx/+1QRlbFxlCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"878d62609c9702f4fa78bf4d15e7a29ee2ce2c36e1213ec43a884048796c8541","last_reissued_at":"2026-05-18T01:30:44.456834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:44.456834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The F-snapshot Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gal Amram","submitted_at":"2015-10-08T07:27:37Z","abstract_excerpt":"Aguilera, Gafni and Lamport introduced the signaling problem in [5]. In this problem, two processes numbered 0 and 1 can call two procedures: update and Fscan. A parameter of the problem is a two- variable function $F(x_0,x_1)$. Each process $p_i$ can assign values to variable $x_i$ by calling update(v) with some data value v, and compute the value: $F(x_0,x_1)$ by executing an Fscan procedure. The problem is interesting when the domain of $F$ is infinite and the range of $F$ is finite. In this case, some \"access restrictions\" are imposed that limit the size of the registers that the Fscan pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02211","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.02211","created_at":"2026-05-18T01:30:44.456964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02211v1","created_at":"2026-05-18T01:30:44.456964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02211","created_at":"2026-05-18T01:30:44.456964+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6GWEYE4S4BP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6GWEYE4S4BPJ6TY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6GWEYE4","created_at":"2026-05-18T12:29:37.295048+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/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3","json":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3.json","graph_json":"https://pith.science/api/pith-number/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/graph.json","events_json":"https://pith.science/api/pith-number/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/events.json","paper":"https://pith.science/paper/Q6GWEYE4"},"agent_actions":{"view_html":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3","download_json":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3.json","view_paper":"https://pith.science/paper/Q6GWEYE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02211&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/action/storage_attestation","attest_author":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/action/author_attestation","sign_citation":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/action/citation_signature","submit_replication":"https://pith.science/pith/Q6GWEYE4S4BPJ6TYX5GRLZ5CT3/action/replication_record"}},"created_at":"2026-05-18T01:30:44.456964+00:00","updated_at":"2026-05-18T01:30:44.456964+00:00"}