{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:X3W6LJCAYYIQF4UJJHMTR6S4RK","short_pith_number":"pith:X3W6LJCA","schema_version":"1.0","canonical_sha256":"beede5a440c61102f28949d938fa5c8aad9c894633d41efbad5955ef8e6e94cd","source":{"kind":"arxiv","id":"1506.02973","version":1},"attestation_state":"computed","paper":{"title":"Fast and simple connectivity in graph timelines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki","submitted_at":"2015-06-09T15:58:59Z","abstract_excerpt":"In this paper we study the problem of answering connectivity queries about a \\emph{graph timeline}. A graph timeline is a sequence of undirected graphs $G_1,\\ldots,G_t$ on a common set of vertices of size $n$ such that each graph is obtained from the previous one by an addition or a deletion of a single edge. We present data structures, which preprocess the timeline and can answer the following queries:\n  - forall$(u,v,a,b)$ -- does the path $u\\to v$ exist in each of $G_a,\\ldots,G_b$?\n  - exists$(u,v,a,b)$ -- does the path $u\\to v$ exist in any of $G_a,\\ldots,G_b$?\n  - forall2$(u,v,a,b)$ -- do"},"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":"1506.02973","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-09T15:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"b4129c601a49e6ba97ea6dfb338a015ebc0061681c9eb3a856e19ffe8ab257d0","abstract_canon_sha256":"e30d2b0eec083f7140799a7bfecbabaa229619ef2d82c0d0056d62137796a1b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:40.374893Z","signature_b64":"Y6FMFrc+rdSiMouz5dkwq4P8hswATuSx2Ca8DA6QqoA+tgrgka+EvQGUZn2XME9Q8Zw5nJIvfzZBIyf3zlWsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beede5a440c61102f28949d938fa5c8aad9c894633d41efbad5955ef8e6e94cd","last_reissued_at":"2026-05-18T01:55:40.374192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:40.374192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and simple connectivity in graph timelines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Jakub {\\L}\\k{a}cki","submitted_at":"2015-06-09T15:58:59Z","abstract_excerpt":"In this paper we study the problem of answering connectivity queries about a \\emph{graph timeline}. A graph timeline is a sequence of undirected graphs $G_1,\\ldots,G_t$ on a common set of vertices of size $n$ such that each graph is obtained from the previous one by an addition or a deletion of a single edge. We present data structures, which preprocess the timeline and can answer the following queries:\n  - forall$(u,v,a,b)$ -- does the path $u\\to v$ exist in each of $G_a,\\ldots,G_b$?\n  - exists$(u,v,a,b)$ -- does the path $u\\to v$ exist in any of $G_a,\\ldots,G_b$?\n  - forall2$(u,v,a,b)$ -- do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02973","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02973","created_at":"2026-05-18T01:55:40.374299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02973v1","created_at":"2026-05-18T01:55:40.374299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02973","created_at":"2026-05-18T01:55:40.374299+00:00"},{"alias_kind":"pith_short_12","alias_value":"X3W6LJCAYYIQ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"X3W6LJCAYYIQF4UJ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"X3W6LJCA","created_at":"2026-05-18T12:29:47.479230+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/X3W6LJCAYYIQF4UJJHMTR6S4RK","json":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK.json","graph_json":"https://pith.science/api/pith-number/X3W6LJCAYYIQF4UJJHMTR6S4RK/graph.json","events_json":"https://pith.science/api/pith-number/X3W6LJCAYYIQF4UJJHMTR6S4RK/events.json","paper":"https://pith.science/paper/X3W6LJCA"},"agent_actions":{"view_html":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK","download_json":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK.json","view_paper":"https://pith.science/paper/X3W6LJCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02973&json=true","fetch_graph":"https://pith.science/api/pith-number/X3W6LJCAYYIQF4UJJHMTR6S4RK/graph.json","fetch_events":"https://pith.science/api/pith-number/X3W6LJCAYYIQF4UJJHMTR6S4RK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK/action/storage_attestation","attest_author":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK/action/author_attestation","sign_citation":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK/action/citation_signature","submit_replication":"https://pith.science/pith/X3W6LJCAYYIQF4UJJHMTR6S4RK/action/replication_record"}},"created_at":"2026-05-18T01:55:40.374299+00:00","updated_at":"2026-05-18T01:55:40.374299+00:00"}