{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:V5SJXDELHKGSJPNMPDCOPTFP4C","short_pith_number":"pith:V5SJXDEL","canonical_record":{"source":{"id":"1003.1058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-04T14:47:17Z","cross_cats_sorted":[],"title_canon_sha256":"f895ec98ba5902df653032bd98fd2b7514278f7873907291fbb96fc453a944cf","abstract_canon_sha256":"cbb3409c9bd22ff511a508df74b17190da5df360a4f4d21f193de81f2f34d887"},"schema_version":"1.0"},"canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","source":{"kind":"arxiv","id":"1003.1058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1058","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1058v2","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1058","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"V5SJXDELHKGS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V5SJXDELHKGSJPNM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V5SJXDEL","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:V5SJXDELHKGSJPNMPDCOPTFP4C","target":"record","payload":{"canonical_record":{"source":{"id":"1003.1058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-04T14:47:17Z","cross_cats_sorted":[],"title_canon_sha256":"f895ec98ba5902df653032bd98fd2b7514278f7873907291fbb96fc453a944cf","abstract_canon_sha256":"cbb3409c9bd22ff511a508df74b17190da5df360a4f4d21f193de81f2f34d887"},"schema_version":"1.0"},"canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:46.330352Z","signature_b64":"R2ai0C2jx9DZHQmbOIztOM9txuXiVYXbtd5A1HhWACncQjQf9q22dy3xWq9SYAkO2S5IAfDisMRbsMPA0uHxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","last_reissued_at":"2026-05-18T02:08:46.329671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:46.329671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.1058","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-18T02:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bII6NPPa2U6Tu3a8nLfCeUE912gqXKD+JlHa3H5LYPgPCatF/kZ11JVERqQcdDGKkPbLrLRgtZPaQdDwjdXCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:15:03.759291Z"},"content_sha256":"5f74927bfb7c301ee7bdd2c6fa50481259ee364527d42451a1016fe42ddcdc65","schema_version":"1.0","event_id":"sha256:5f74927bfb7c301ee7bdd2c6fa50481259ee364527d42451a1016fe42ddcdc65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:V5SJXDELHKGSJPNMPDCOPTFP4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms For Extracting Timeliness Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Carole Delporte-Gallet (LIAFA), Hugues Fauconnier (LIAFA), Mikel Larrea, St\\'ephane Devismes (VERIMAG - IMAG)","submitted_at":"2010-03-04T14:47:17Z","abstract_excerpt":"We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1058","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-18T02:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RPkstZLqj9NDIFJ6IoSnAELf1YJ/NposrXNXpn3/8yZtdbk+8bak0ARlhKfmB84Bub5XZokkg3rEzk4uSiDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:15:03.759954Z"},"content_sha256":"042a04062255e852d2ddfcbb04ce82ae7ed30ff8295a62b8a087358dbbdbd5f9","schema_version":"1.0","event_id":"sha256:042a04062255e852d2ddfcbb04ce82ae7ed30ff8295a62b8a087358dbbdbd5f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/bundle.json","state_url":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/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-26T11:15:03Z","links":{"resolver":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C","bundle":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/bundle.json","state":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:V5SJXDELHKGSJPNMPDCOPTFP4C","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":"cbb3409c9bd22ff511a508df74b17190da5df360a4f4d21f193de81f2f34d887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-04T14:47:17Z","title_canon_sha256":"f895ec98ba5902df653032bd98fd2b7514278f7873907291fbb96fc453a944cf"},"schema_version":"1.0","source":{"id":"1003.1058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1058","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1058v2","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1058","created_at":"2026-05-18T02:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"V5SJXDELHKGS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"V5SJXDELHKGSJPNM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"V5SJXDEL","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:042a04062255e852d2ddfcbb04ce82ae7ed30ff8295a62b8a087358dbbdbd5f9","target":"graph","created_at":"2026-05-18T02:08:46Z","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":"We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process h","authors_text":"Carole Delporte-Gallet (LIAFA), Hugues Fauconnier (LIAFA), Mikel Larrea, St\\'ephane Devismes (VERIMAG - IMAG)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-04T14:47:17Z","title":"Algorithms For Extracting Timeliness Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1058","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:5f74927bfb7c301ee7bdd2c6fa50481259ee364527d42451a1016fe42ddcdc65","target":"record","created_at":"2026-05-18T02:08:46Z","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":"cbb3409c9bd22ff511a508df74b17190da5df360a4f4d21f193de81f2f34d887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-03-04T14:47:17Z","title_canon_sha256":"f895ec98ba5902df653032bd98fd2b7514278f7873907291fbb96fc453a944cf"},"schema_version":"1.0","source":{"id":"1003.1058","kind":"arxiv","version":2}},"canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","first_computed_at":"2026-05-18T02:08:46.329671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:46.329671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2ai0C2jx9DZHQmbOIztOM9txuXiVYXbtd5A1HhWACncQjQf9q22dy3xWq9SYAkO2S5IAfDisMRbsMPA0uHxDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:46.330352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.1058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f74927bfb7c301ee7bdd2c6fa50481259ee364527d42451a1016fe42ddcdc65","sha256:042a04062255e852d2ddfcbb04ce82ae7ed30ff8295a62b8a087358dbbdbd5f9"],"state_sha256":"a95465f4b85c76dec8a73c5d472d234026bc12659fb094b778d203ca809566e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+Lee4QTxI7Mome7s7amISxVHbhc+xw7OBFxc0s2MRUKenq/nqTmcFci30yHWF5EMA9haGCSFxgWvDlE0PbnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:15:03.763335Z","bundle_sha256":"7c071ef487e326d7a384427d4a1e41ed267ba837d5379fc6a6f47b4dfc83026f"}}