{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RAWQARNNIOLC7AN3S772TBGI2S","short_pith_number":"pith:RAWQARNN","canonical_record":{"source":{"id":"1105.3843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-19T11:18:46Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"445d58d141cf5930088d480a8c73c757a8ba1f94dad4fabfc48048154c0ae151","abstract_canon_sha256":"efcb7ef5fd5f12c8ab39c1f6f5c8397b6eaf2a2f3158d497a8904cc8271c1f85"},"schema_version":"1.0"},"canonical_sha256":"882d0045ad43962f81bb97ffa984c8d48a3994f21e406c0e90bb4c28738c079d","source":{"kind":"arxiv","id":"1105.3843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3843","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3843v1","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3843","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"RAWQARNNIOLC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAWQARNNIOLC7AN3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAWQARNN","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RAWQARNNIOLC7AN3S772TBGI2S","target":"record","payload":{"canonical_record":{"source":{"id":"1105.3843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-19T11:18:46Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"445d58d141cf5930088d480a8c73c757a8ba1f94dad4fabfc48048154c0ae151","abstract_canon_sha256":"efcb7ef5fd5f12c8ab39c1f6f5c8397b6eaf2a2f3158d497a8904cc8271c1f85"},"schema_version":"1.0"},"canonical_sha256":"882d0045ad43962f81bb97ffa984c8d48a3994f21e406c0e90bb4c28738c079d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:51.218130Z","signature_b64":"kWuTnSHZM8goDSKpwXIFQG/hmSlkbjEFg27j7/xxdNNw4r3HE3MVkVYAuZVat/XGEgLqcQTVYm/Cxj7hNS+ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"882d0045ad43962f81bb97ffa984c8d48a3994f21e406c0e90bb4c28738c079d","last_reissued_at":"2026-05-18T04:21:51.217594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:51.217594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.3843","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-18T04:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJiBSjFIv9nsS7jsQvFNC7Mk52wsB3TBEpVGfKsJJaLs4N2FD2pgxcuQWJ3iiPVzDAmZArqzvNWNHkzZkJzVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:00:59.629142Z"},"content_sha256":"2f2ca2269f70729752eb883c4b222d521ea5f0aec7921fba5699d6d9b153b743","schema_version":"1.0","event_id":"sha256:2f2ca2269f70729752eb883c4b222d521ea5f0aec7921fba5699d6d9b153b743"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RAWQARNNIOLC7AN3S772TBGI2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Distributed Process Creation with the XMOS XS1 Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DC","authors_text":"James Hanlon, Simon J. Hollis","submitted_at":"2011-05-19T11:18:46Z","abstract_excerpt":"The provision of mechanisms for processor allocation in current distributed parallel programming models is very limited. This makes difficult, or even prohibits, the expression of a large class of programs which require a run-time assessment of their required resources. This includes programs whose structure is irregular, composite or unbounded. Efficient allocation of processors requires a process creation mechanism able to initiate and terminate remote computations quickly. This paper presents the design, demonstration and analysis of an explicit mechanism to do this, implemented on the XMOS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3843","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-18T04:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYOMB49MdznaNx5p/FNvJvu+28fdl7I63xjlFSfUcYmiYx1gHLxtuArhF6tt1RE+/uzfZgEiztYZrsY/JhKCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:00:59.629696Z"},"content_sha256":"750fef5a48046c52fc3c01d0c654a8ef644ba6df1bb6b213fc3dc32333cbf82a","schema_version":"1.0","event_id":"sha256:750fef5a48046c52fc3c01d0c654a8ef644ba6df1bb6b213fc3dc32333cbf82a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAWQARNNIOLC7AN3S772TBGI2S/bundle.json","state_url":"https://pith.science/pith/RAWQARNNIOLC7AN3S772TBGI2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAWQARNNIOLC7AN3S772TBGI2S/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-07T11:00:59Z","links":{"resolver":"https://pith.science/pith/RAWQARNNIOLC7AN3S772TBGI2S","bundle":"https://pith.science/pith/RAWQARNNIOLC7AN3S772TBGI2S/bundle.json","state":"https://pith.science/pith/RAWQARNNIOLC7AN3S772TBGI2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAWQARNNIOLC7AN3S772TBGI2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RAWQARNNIOLC7AN3S772TBGI2S","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":"efcb7ef5fd5f12c8ab39c1f6f5c8397b6eaf2a2f3158d497a8904cc8271c1f85","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-19T11:18:46Z","title_canon_sha256":"445d58d141cf5930088d480a8c73c757a8ba1f94dad4fabfc48048154c0ae151"},"schema_version":"1.0","source":{"id":"1105.3843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3843","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3843v1","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3843","created_at":"2026-05-18T04:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"RAWQARNNIOLC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAWQARNNIOLC7AN3","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAWQARNN","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:750fef5a48046c52fc3c01d0c654a8ef644ba6df1bb6b213fc3dc32333cbf82a","target":"graph","created_at":"2026-05-18T04:21:51Z","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 provision of mechanisms for processor allocation in current distributed parallel programming models is very limited. This makes difficult, or even prohibits, the expression of a large class of programs which require a run-time assessment of their required resources. This includes programs whose structure is irregular, composite or unbounded. Efficient allocation of processors requires a process creation mechanism able to initiate and terminate remote computations quickly. This paper presents the design, demonstration and analysis of an explicit mechanism to do this, implemented on the XMOS","authors_text":"James Hanlon, Simon J. Hollis","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-19T11:18:46Z","title":"Fast Distributed Process Creation with the XMOS XS1 Architecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3843","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:2f2ca2269f70729752eb883c4b222d521ea5f0aec7921fba5699d6d9b153b743","target":"record","created_at":"2026-05-18T04:21:51Z","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":"efcb7ef5fd5f12c8ab39c1f6f5c8397b6eaf2a2f3158d497a8904cc8271c1f85","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-19T11:18:46Z","title_canon_sha256":"445d58d141cf5930088d480a8c73c757a8ba1f94dad4fabfc48048154c0ae151"},"schema_version":"1.0","source":{"id":"1105.3843","kind":"arxiv","version":1}},"canonical_sha256":"882d0045ad43962f81bb97ffa984c8d48a3994f21e406c0e90bb4c28738c079d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882d0045ad43962f81bb97ffa984c8d48a3994f21e406c0e90bb4c28738c079d","first_computed_at":"2026-05-18T04:21:51.217594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:51.217594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWuTnSHZM8goDSKpwXIFQG/hmSlkbjEFg27j7/xxdNNw4r3HE3MVkVYAuZVat/XGEgLqcQTVYm/Cxj7hNS+ODg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:51.218130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f2ca2269f70729752eb883c4b222d521ea5f0aec7921fba5699d6d9b153b743","sha256:750fef5a48046c52fc3c01d0c654a8ef644ba6df1bb6b213fc3dc32333cbf82a"],"state_sha256":"fad2d907917977b94e1e0cba3b3e1bf60cc1e4495c633b1a0cf78f4f30cba131"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5ENTszv8VmoeHMx5mO/wUr7JefpeAySEu9nAX5oqMgUxWi7Y7b1hyZxUX5Yf3qchmJaLCTqKG5NldlCNSapDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:00:59.631741Z","bundle_sha256":"fc94882b9daf4e970163e2870e77f30a8bb468f590e9d86d5e62eb66ccf7d717"}}