{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H2C4CSFAPUDWPCNHBMVNB7TPLG","short_pith_number":"pith:H2C4CSFA","canonical_record":{"source":{"id":"1805.06267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-16T12:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"988c8082e0578919060fcaaacbf13a5cb1041e76f97f3bf75a436c1745427f1f","abstract_canon_sha256":"8804ad320d176c81a6927aa54a2d467a56b2d38e9e324a16f006955631a2584a"},"schema_version":"1.0"},"canonical_sha256":"3e85c148a07d076789a70b2ad0fe6f598cdb756225f81facc8dadc866b0e64ff","source":{"kind":"arxiv","id":"1805.06267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06267","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06267v2","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06267","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"H2C4CSFAPUDW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"H2C4CSFAPUDWPCNH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"H2C4CSFA","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H2C4CSFAPUDWPCNHBMVNB7TPLG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-16T12:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"988c8082e0578919060fcaaacbf13a5cb1041e76f97f3bf75a436c1745427f1f","abstract_canon_sha256":"8804ad320d176c81a6927aa54a2d467a56b2d38e9e324a16f006955631a2584a"},"schema_version":"1.0"},"canonical_sha256":"3e85c148a07d076789a70b2ad0fe6f598cdb756225f81facc8dadc866b0e64ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:49.454727Z","signature_b64":"uM+/L0DbRpOJ49cvJ4MFn5zV/K2/SSUKlhvpmjOdDiR+c4rw95BAxH7NkvEqDkwIRzSgF61jSwYnBTJhSRIFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e85c148a07d076789a70b2ad0fe6f598cdb756225f81facc8dadc866b0e64ff","last_reissued_at":"2026-05-18T00:07:49.454057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:49.454057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06267","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-18T00:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elyNn+A5O80MPlcfCHayT0gSW+DnOOO9vFld2/GK4xuLI75p6ub1c8gWWQxJwaTownLE4jtkyErxe43LRUThDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:09.853906Z"},"content_sha256":"652013d40283331367ac6be8f53a56f4ce25b1a8490698b2fb697ca32545d998","schema_version":"1.0","event_id":"sha256:652013d40283331367ac6be8f53a56f4ce25b1a8490698b2fb697ca32545d998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H2C4CSFAPUDWPCNHBMVNB7TPLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Deterministic Record & Replay for Actor Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Cl\\'ement B\\'era, Dominik Aumayr, Elisa Gonzalez Boix, Hanspeter M\\\"ossenb\\\"ock, Stefan Marr","submitted_at":"2018-05-16T12:18:17Z","abstract_excerpt":"With the ubiquity of parallel commodity hardware, developers turn to high-level concurrency models such as the actor model to lower the complexity of concurrent software. However, debugging concurrent software is hard, especially for concurrency models with a limited set of supporting tools. Such tools often deal only with the underlying threads and locks, which is at the wrong abstraction level and may even introduce additional complexity. To improve on this situation, we present a low-overhead record & replay approach for actor languages. It allows one to debug concurrency issues determinist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06267","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-18T00:07:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HQ+6lfOA8kZHKOLC0n9xZAarnJfPQ5SLUoVcw6K7ivIb18JY4P6tJBm5LpR0o05bkOA0pxCrx0ojUBfFneLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:09:09.854247Z"},"content_sha256":"462d4f9e2ec6fe7db10824d026f0fbe66ee3f8deee37b788b70de14179abc202","schema_version":"1.0","event_id":"sha256:462d4f9e2ec6fe7db10824d026f0fbe66ee3f8deee37b788b70de14179abc202"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/bundle.json","state_url":"https://pith.science/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/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-07-03T22:09:09Z","links":{"resolver":"https://pith.science/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG","bundle":"https://pith.science/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/bundle.json","state":"https://pith.science/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2C4CSFAPUDWPCNHBMVNB7TPLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H2C4CSFAPUDWPCNHBMVNB7TPLG","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":"8804ad320d176c81a6927aa54a2d467a56b2d38e9e324a16f006955631a2584a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-16T12:18:17Z","title_canon_sha256":"988c8082e0578919060fcaaacbf13a5cb1041e76f97f3bf75a436c1745427f1f"},"schema_version":"1.0","source":{"id":"1805.06267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06267","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06267v2","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06267","created_at":"2026-05-18T00:07:49Z"},{"alias_kind":"pith_short_12","alias_value":"H2C4CSFAPUDW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"H2C4CSFAPUDWPCNH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"H2C4CSFA","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:462d4f9e2ec6fe7db10824d026f0fbe66ee3f8deee37b788b70de14179abc202","target":"graph","created_at":"2026-05-18T00:07:49Z","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":"With the ubiquity of parallel commodity hardware, developers turn to high-level concurrency models such as the actor model to lower the complexity of concurrent software. However, debugging concurrent software is hard, especially for concurrency models with a limited set of supporting tools. Such tools often deal only with the underlying threads and locks, which is at the wrong abstraction level and may even introduce additional complexity. To improve on this situation, we present a low-overhead record & replay approach for actor languages. It allows one to debug concurrency issues determinist","authors_text":"Cl\\'ement B\\'era, Dominik Aumayr, Elisa Gonzalez Boix, Hanspeter M\\\"ossenb\\\"ock, Stefan Marr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-16T12:18:17Z","title":"Efficient and Deterministic Record & Replay for Actor Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06267","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:652013d40283331367ac6be8f53a56f4ce25b1a8490698b2fb697ca32545d998","target":"record","created_at":"2026-05-18T00:07:49Z","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":"8804ad320d176c81a6927aa54a2d467a56b2d38e9e324a16f006955631a2584a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-16T12:18:17Z","title_canon_sha256":"988c8082e0578919060fcaaacbf13a5cb1041e76f97f3bf75a436c1745427f1f"},"schema_version":"1.0","source":{"id":"1805.06267","kind":"arxiv","version":2}},"canonical_sha256":"3e85c148a07d076789a70b2ad0fe6f598cdb756225f81facc8dadc866b0e64ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e85c148a07d076789a70b2ad0fe6f598cdb756225f81facc8dadc866b0e64ff","first_computed_at":"2026-05-18T00:07:49.454057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:49.454057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uM+/L0DbRpOJ49cvJ4MFn5zV/K2/SSUKlhvpmjOdDiR+c4rw95BAxH7NkvEqDkwIRzSgF61jSwYnBTJhSRIFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:49.454727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:652013d40283331367ac6be8f53a56f4ce25b1a8490698b2fb697ca32545d998","sha256:462d4f9e2ec6fe7db10824d026f0fbe66ee3f8deee37b788b70de14179abc202"],"state_sha256":"d3ca8d77e0d5a066878f104850efa45e5de5dacf66ae3f6917412cca3b0a5150"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpFTHxFwxROUlG5DW2dYQct3pICC5dLi1d2gzI4i19SwOxd89JgeMRkWkAXuHGw/4tV83L0eqVMatArh+AKGCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:09:09.856179Z","bundle_sha256":"ff5638327b8cbf677b8bd7328e0bb8b53e4881614b4a74e5a159c23d6f9916d7"}}