{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V5SJXDELHKGSJPNMPDCOPTFP4C","short_pith_number":"pith:V5SJXDEL","schema_version":"1.0","canonical_sha256":"af649b8c8b3a8d24bdac78c4e7ccafe0b52d1cd27a0d5eaadebcce5fecbc4a85","source":{"kind":"arxiv","id":"1003.1058","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1003.1058","created_at":"2026-05-18T02:08:46.329793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.1058v2","created_at":"2026-05-18T02:08:46.329793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1058","created_at":"2026-05-18T02:08:46.329793+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5SJXDELHKGS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5SJXDELHKGSJPNM","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5SJXDEL","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C","json":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C.json","graph_json":"https://pith.science/api/pith-number/V5SJXDELHKGSJPNMPDCOPTFP4C/graph.json","events_json":"https://pith.science/api/pith-number/V5SJXDELHKGSJPNMPDCOPTFP4C/events.json","paper":"https://pith.science/paper/V5SJXDEL"},"agent_actions":{"view_html":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C","download_json":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C.json","view_paper":"https://pith.science/paper/V5SJXDEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.1058&json=true","fetch_graph":"https://pith.science/api/pith-number/V5SJXDELHKGSJPNMPDCOPTFP4C/graph.json","fetch_events":"https://pith.science/api/pith-number/V5SJXDELHKGSJPNMPDCOPTFP4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/action/storage_attestation","attest_author":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/action/author_attestation","sign_citation":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/action/citation_signature","submit_replication":"https://pith.science/pith/V5SJXDELHKGSJPNMPDCOPTFP4C/action/replication_record"}},"created_at":"2026-05-18T02:08:46.329793+00:00","updated_at":"2026-05-18T02:08:46.329793+00:00"}