{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RFJMFWDVGZ2OHZ4OMJS372SIX2","short_pith_number":"pith:RFJMFWDV","canonical_record":{"source":{"id":"1204.6170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-27T11:14:54Z","cross_cats_sorted":[],"title_canon_sha256":"d8c50c9b63d0242fbd4e5c461dd33085038869526918d02380a86fcc52fb2b13","abstract_canon_sha256":"90d299526165660f1687bf76bb201ec32700615fa1ae1ec3c449ed602942da19"},"schema_version":"1.0"},"canonical_sha256":"8952c2d8753674e3e78e6265bfea48be956c006e703257a0825e4ff9d981ce59","source":{"kind":"arxiv","id":"1204.6170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6170","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6170v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6170","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"RFJMFWDVGZ2O","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RFJMFWDVGZ2OHZ4O","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RFJMFWDV","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RFJMFWDVGZ2OHZ4OMJS372SIX2","target":"record","payload":{"canonical_record":{"source":{"id":"1204.6170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-27T11:14:54Z","cross_cats_sorted":[],"title_canon_sha256":"d8c50c9b63d0242fbd4e5c461dd33085038869526918d02380a86fcc52fb2b13","abstract_canon_sha256":"90d299526165660f1687bf76bb201ec32700615fa1ae1ec3c449ed602942da19"},"schema_version":"1.0"},"canonical_sha256":"8952c2d8753674e3e78e6265bfea48be956c006e703257a0825e4ff9d981ce59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:37.004901Z","signature_b64":"JH+fBgLYs/dGsmYNm0ueSWy5bYH9Hh/Z/iFPe42nGVURABpBfXDp4/h0411rwqKMZsZjqmTK/wInIk1Ho9ztBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8952c2d8753674e3e78e6265bfea48be956c006e703257a0825e4ff9d981ce59","last_reissued_at":"2026-05-18T03:54:37.004248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:37.004248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.6170","source_version":2,"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-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GD0+n2ZaRWj8b2bebbi/nCNAtGUavRV80zruhaYy089RsEYKyrWblNoBFJDd9Wzd0JrKcm8E/P5zJ6RTRsf8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:56:47.309114Z"},"content_sha256":"fb3119fb56cc3a92526dc3e9f7b50b8ffe274898cb0b07b89c23453dc88a81b8","schema_version":"1.0","event_id":"sha256:fb3119fb56cc3a92526dc3e9f7b50b8ffe274898cb0b07b89c23453dc88a81b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RFJMFWDVGZ2OHZ4OMJS372SIX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A distributed resource allocation algorithm for many processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Wim H. Hesselink","submitted_at":"2012-04-27T11:14:54Z","abstract_excerpt":"Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, levels can be distinguished, such as e.g. read access or write access. We allow infinitely many processes that communicate by reliable asynchronous messages and have finite memory. A simple starvation-free solution is presented. Processes only wait for one another when they have conflicting resource "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6170","kind":"arxiv","version":2},"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-18T03:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eWl/QmfJflkApPs6VbkgH28zZkAiC/ahq532JjVnwkuYTjmECt1RDu7rFl47HGEK3i1K+ZzkFlh6y1E3itb9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:56:47.309814Z"},"content_sha256":"dba901dc39ab9c72d73927af7f346c6715067d699fefb85cf666b8d32d799e34","schema_version":"1.0","event_id":"sha256:dba901dc39ab9c72d73927af7f346c6715067d699fefb85cf666b8d32d799e34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/bundle.json","state_url":"https://pith.science/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/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-06-08T16:56:47Z","links":{"resolver":"https://pith.science/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2","bundle":"https://pith.science/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/bundle.json","state":"https://pith.science/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFJMFWDVGZ2OHZ4OMJS372SIX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RFJMFWDVGZ2OHZ4OMJS372SIX2","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":"90d299526165660f1687bf76bb201ec32700615fa1ae1ec3c449ed602942da19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-27T11:14:54Z","title_canon_sha256":"d8c50c9b63d0242fbd4e5c461dd33085038869526918d02380a86fcc52fb2b13"},"schema_version":"1.0","source":{"id":"1204.6170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.6170","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.6170v2","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.6170","created_at":"2026-05-18T03:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"RFJMFWDVGZ2O","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RFJMFWDVGZ2OHZ4O","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RFJMFWDV","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:dba901dc39ab9c72d73927af7f346c6715067d699fefb85cf666b8d32d799e34","target":"graph","created_at":"2026-05-18T03:54:37Z","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":"Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these requirements are given anew. In the resource requirements, levels can be distinguished, such as e.g. read access or write access. We allow infinitely many processes that communicate by reliable asynchronous messages and have finite memory. A simple starvation-free solution is presented. Processes only wait for one another when they have conflicting resource ","authors_text":"Wim H. Hesselink","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-27T11:14:54Z","title":"A distributed resource allocation algorithm for many processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.6170","kind":"arxiv","version":2},"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:fb3119fb56cc3a92526dc3e9f7b50b8ffe274898cb0b07b89c23453dc88a81b8","target":"record","created_at":"2026-05-18T03:54:37Z","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":"90d299526165660f1687bf76bb201ec32700615fa1ae1ec3c449ed602942da19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-27T11:14:54Z","title_canon_sha256":"d8c50c9b63d0242fbd4e5c461dd33085038869526918d02380a86fcc52fb2b13"},"schema_version":"1.0","source":{"id":"1204.6170","kind":"arxiv","version":2}},"canonical_sha256":"8952c2d8753674e3e78e6265bfea48be956c006e703257a0825e4ff9d981ce59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8952c2d8753674e3e78e6265bfea48be956c006e703257a0825e4ff9d981ce59","first_computed_at":"2026-05-18T03:54:37.004248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:37.004248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JH+fBgLYs/dGsmYNm0ueSWy5bYH9Hh/Z/iFPe42nGVURABpBfXDp4/h0411rwqKMZsZjqmTK/wInIk1Ho9ztBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:37.004901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.6170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb3119fb56cc3a92526dc3e9f7b50b8ffe274898cb0b07b89c23453dc88a81b8","sha256:dba901dc39ab9c72d73927af7f346c6715067d699fefb85cf666b8d32d799e34"],"state_sha256":"7b73a47848537620cceb5824ddadd0259a27c9efb50b5ae0227eb12c6a31f31e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bd7CRrpUB1HWx0NtXDb/V/EF+R23EqstxqdnvA3i76P8m5xnPZg0yAMuJCj+FhmEr6EKmL1TqdJknWVzMLugCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:56:47.313874Z","bundle_sha256":"99b85cb54703c93a184d42770863b18ba8aa78086463d29380f35204036f31b9"}}