{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:62WFYDR4U45YB5MMP4SW3FEJ6T","short_pith_number":"pith:62WFYDR4","canonical_record":{"source":{"id":"1810.03723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-08T22:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"515db822db4299d7cbe22554d765b61514fbcf01b1a54fd5339c2675f0b4a3b8","abstract_canon_sha256":"10847986cbc531639bf5faba58360a20dbe42e813e6618173cad6b392ae2c03c"},"schema_version":"1.0"},"canonical_sha256":"f6ac5c0e3ca73b80f58c7f256d9489f4c2af607988f2c30a294fe4bbdbdf20d6","source":{"kind":"arxiv","id":"1810.03723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03723","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03723v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03723","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"62WFYDR4U45Y","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"62WFYDR4U45YB5MM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"62WFYDR4","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:62WFYDR4U45YB5MMP4SW3FEJ6T","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-08T22:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"515db822db4299d7cbe22554d765b61514fbcf01b1a54fd5339c2675f0b4a3b8","abstract_canon_sha256":"10847986cbc531639bf5faba58360a20dbe42e813e6618173cad6b392ae2c03c"},"schema_version":"1.0"},"canonical_sha256":"f6ac5c0e3ca73b80f58c7f256d9489f4c2af607988f2c30a294fe4bbdbdf20d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:44.661073Z","signature_b64":"2J18AHuRhG/PeWrqQ0z/8VZ4raB5WPYN3EbMRSeuJghAThQKLDXSJzw882JUmWMEsZO1MzSLBk32mqOaUvduCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6ac5c0e3ca73b80f58c7f256d9489f4c2af607988f2c30a294fe4bbdbdf20d6","last_reissued_at":"2026-05-18T00:03:44.660550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:44.660550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03723","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hofMawaoXrXWQ8aMinpmJmLWNhE/x6qy052qGlxwv4sDnLNB/PMxavU3uYMFJ0ctGzcLz6fiDJuXcOhZs4mnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:11.871839Z"},"content_sha256":"14697bca8eb0963d18ab39b862e49fcca9ef88e21a64478b7bf07ce257db241f","schema_version":"1.0","event_id":"sha256:14697bca8eb0963d18ab39b862e49fcca9ef88e21a64478b7bf07ce257db241f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:62WFYDR4U45YB5MMP4SW3FEJ6T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Gadi Taubenfeld, Michel Raynal, Philipp Woelfel, Zahra Aghazadeh","submitted_at":"2018-10-08T22:06:48Z","abstract_excerpt":"The notion of an anonymous shared memory (recently introduced in PODC 2017) considers that processes use different names for the same memory location. Hence, there is permanent disagreement on the location names among processes. In this context, the PODC paper presented -among other results- a symmetric deadlock-free mutual exclusion (mutex) algorithm for two processes and a necessary condition on the size $m$ of the anonymous memory for the existence of a symmetric deadlock-free mutex algorithm in an $n$-process system. This condition states that $m$ must be greater than $1$ and belong to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03723","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8oRGVTcAy2XCaTQ4js/v+O+FLhBIgVdkCJESPQ4ehoNfiWOUChBpeeydvhnM6rvV49kGOOc9WQzl1cn1kiwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:11.872185Z"},"content_sha256":"f4477efe010a2874ad890238f14b781ed5be4bd93f42d845b8bba4d2a66dead1","schema_version":"1.0","event_id":"sha256:f4477efe010a2874ad890238f14b781ed5be4bd93f42d845b8bba4d2a66dead1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/bundle.json","state_url":"https://pith.science/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T08:35:11Z","links":{"resolver":"https://pith.science/pith/62WFYDR4U45YB5MMP4SW3FEJ6T","bundle":"https://pith.science/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/bundle.json","state":"https://pith.science/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62WFYDR4U45YB5MMP4SW3FEJ6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:62WFYDR4U45YB5MMP4SW3FEJ6T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"10847986cbc531639bf5faba58360a20dbe42e813e6618173cad6b392ae2c03c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-08T22:06:48Z","title_canon_sha256":"515db822db4299d7cbe22554d765b61514fbcf01b1a54fd5339c2675f0b4a3b8"},"schema_version":"1.0","source":{"id":"1810.03723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03723","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03723v1","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03723","created_at":"2026-05-18T00:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"62WFYDR4U45Y","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"62WFYDR4U45YB5MM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"62WFYDR4","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:f4477efe010a2874ad890238f14b781ed5be4bd93f42d845b8bba4d2a66dead1","target":"graph","created_at":"2026-05-18T00:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The notion of an anonymous shared memory (recently introduced in PODC 2017) considers that processes use different names for the same memory location. Hence, there is permanent disagreement on the location names among processes. In this context, the PODC paper presented -among other results- a symmetric deadlock-free mutual exclusion (mutex) algorithm for two processes and a necessary condition on the size $m$ of the anonymous memory for the existence of a symmetric deadlock-free mutex algorithm in an $n$-process system. This condition states that $m$ must be greater than $1$ and belong to the","authors_text":"Damien Imbs, Gadi Taubenfeld, Michel Raynal, Philipp Woelfel, Zahra Aghazadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-08T22:06:48Z","title":"Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03723","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:14697bca8eb0963d18ab39b862e49fcca9ef88e21a64478b7bf07ce257db241f","target":"record","created_at":"2026-05-18T00:03:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"10847986cbc531639bf5faba58360a20dbe42e813e6618173cad6b392ae2c03c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-08T22:06:48Z","title_canon_sha256":"515db822db4299d7cbe22554d765b61514fbcf01b1a54fd5339c2675f0b4a3b8"},"schema_version":"1.0","source":{"id":"1810.03723","kind":"arxiv","version":1}},"canonical_sha256":"f6ac5c0e3ca73b80f58c7f256d9489f4c2af607988f2c30a294fe4bbdbdf20d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6ac5c0e3ca73b80f58c7f256d9489f4c2af607988f2c30a294fe4bbdbdf20d6","first_computed_at":"2026-05-18T00:03:44.660550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:44.660550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2J18AHuRhG/PeWrqQ0z/8VZ4raB5WPYN3EbMRSeuJghAThQKLDXSJzw882JUmWMEsZO1MzSLBk32mqOaUvduCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:44.661073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14697bca8eb0963d18ab39b862e49fcca9ef88e21a64478b7bf07ce257db241f","sha256:f4477efe010a2874ad890238f14b781ed5be4bd93f42d845b8bba4d2a66dead1"],"state_sha256":"3cfc25e26ed75d2fff4c8527f06214351386e3af9a651c7e75ba2cd545a31930"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KC7c5b1eK6dk7xCaU+jqKQ8jmd8MOOJvFtkgUhIi29hNpvgKE/nBFZxN+p8hi5OzouyhjLUWIL/D8Z31tBEnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:35:11.874115Z","bundle_sha256":"d48f6ef0d3c0ff7333b43c135c413f56cf6fcc5377abf8a07ee82ce1ab59ca2a"}}