{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OG5FBJN7KOSTLRXJJWJACARM4Y","short_pith_number":"pith:OG5FBJN7","canonical_record":{"source":{"id":"2502.01321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-03T12:53:11Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"b64840ea1d48f6568bdffc41d32986d9695f6c539debd127d584651297aecd56","abstract_canon_sha256":"c9141c1e774e6a9b73be1d7269764015a8d46048d25ce7b53ac645ee42608a1f"},"schema_version":"1.0"},"canonical_sha256":"71ba50a5bf53a535c6e94d9201022ce62954b30409af99ab0e2eb9770b1f32ac","source":{"kind":"arxiv","id":"2502.01321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01321","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01321v1","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01321","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"OG5FBJN7KOST","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"OG5FBJN7KOSTLRXJ","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"OG5FBJN7","created_at":"2026-07-05T10:08:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OG5FBJN7KOSTLRXJJWJACARM4Y","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-03T12:53:11Z","cross_cats_sorted":["cs.DC","cs.NI"],"title_canon_sha256":"b64840ea1d48f6568bdffc41d32986d9695f6c539debd127d584651297aecd56","abstract_canon_sha256":"c9141c1e774e6a9b73be1d7269764015a8d46048d25ce7b53ac645ee42608a1f"},"schema_version":"1.0"},"canonical_sha256":"71ba50a5bf53a535c6e94d9201022ce62954b30409af99ab0e2eb9770b1f32ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:45.696391Z","signature_b64":"nAyr2/gH7gP80XLrjPTxtbp7OSkEieWvXpJ7gnh8mDvVZEKanEAQUw+7ZQVckhkYFe2IcWDEAsx2csPQ9zmHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71ba50a5bf53a535c6e94d9201022ce62954b30409af99ab0e2eb9770b1f32ac","last_reissued_at":"2026-07-05T10:08:45.695896Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:45.695896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01321","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-07-05T10:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rESTS60k4KQUbm3POUn04c6sjBQVLBx6csGCNHFijafrCPtx/6y1h4GvMdBiT0Sp1OsKo5i7B9QHQnyOu9xeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:24:31.701285Z"},"content_sha256":"7ac435f8180bbd19da3e51cd41bf63441fdef702c6518cdfcb82ee5c4065c115","schema_version":"1.0","event_id":"sha256:7ac435f8180bbd19da3e51cd41bf63441fdef702c6518cdfcb82ee5c4065c115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OG5FBJN7KOSTLRXJJWJACARM4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dismountability in Temporal Cliques Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI"],"primary_cat":"cs.DM","authors_text":"Arnaud Casteigts, Daniele Carnevale, Timoth\\'ee Corsini","submitted_at":"2025-02-03T12:53:11Z","abstract_excerpt":"A temporal graph is a graph whose edges are available only at certain points in time. It is temporally connected if the nodes can reach each other by paths that traverse the edges chronologically (temporal paths). In general, temporal graphs do not always admit small subsets of edges that preserve connectivity (temporal spanners). In the case of temporal cliques, spanners of size $O(n\\log n)$ are guaranteed. The original proof by Casteigts et al. [ICALP 2019] combines a number of techniques, one of which is dismountability. In a recent work, Angrick et al. [ESA 2024] simplified the proof and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iM+7wCq2i2fYUFzNhdnQlYA0bk2tK/31fxxC9xlIMuJXoNLs6Kz3p/WdyYIh2kVoL9I1zyVSPLyNIjUcEuBLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:24:31.701680Z"},"content_sha256":"34d0adebde953359810d920ecf72e5185585326e2b952ac7fd44f2525984ffe6","schema_version":"1.0","event_id":"sha256:34d0adebde953359810d920ecf72e5185585326e2b952ac7fd44f2525984ffe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/bundle.json","state_url":"https://pith.science/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/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-12T07:24:31Z","links":{"resolver":"https://pith.science/pith/OG5FBJN7KOSTLRXJJWJACARM4Y","bundle":"https://pith.science/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/bundle.json","state":"https://pith.science/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG5FBJN7KOSTLRXJJWJACARM4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OG5FBJN7KOSTLRXJJWJACARM4Y","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":"c9141c1e774e6a9b73be1d7269764015a8d46048d25ce7b53ac645ee42608a1f","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-03T12:53:11Z","title_canon_sha256":"b64840ea1d48f6568bdffc41d32986d9695f6c539debd127d584651297aecd56"},"schema_version":"1.0","source":{"id":"2502.01321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01321","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01321v1","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01321","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"OG5FBJN7KOST","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"OG5FBJN7KOSTLRXJ","created_at":"2026-07-05T10:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"OG5FBJN7","created_at":"2026-07-05T10:08:45Z"}],"graph_snapshots":[{"event_id":"sha256:34d0adebde953359810d920ecf72e5185585326e2b952ac7fd44f2525984ffe6","target":"graph","created_at":"2026-07-05T10:08:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.01321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A temporal graph is a graph whose edges are available only at certain points in time. It is temporally connected if the nodes can reach each other by paths that traverse the edges chronologically (temporal paths). In general, temporal graphs do not always admit small subsets of edges that preserve connectivity (temporal spanners). In the case of temporal cliques, spanners of size $O(n\\log n)$ are guaranteed. The original proof by Casteigts et al. [ICALP 2019] combines a number of techniques, one of which is dismountability. In a recent work, Angrick et al. [ESA 2024] simplified the proof and s","authors_text":"Arnaud Casteigts, Daniele Carnevale, Timoth\\'ee Corsini","cross_cats":["cs.DC","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-03T12:53:11Z","title":"Dismountability in Temporal Cliques Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01321","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:7ac435f8180bbd19da3e51cd41bf63441fdef702c6518cdfcb82ee5c4065c115","target":"record","created_at":"2026-07-05T10:08:45Z","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":"c9141c1e774e6a9b73be1d7269764015a8d46048d25ce7b53ac645ee42608a1f","cross_cats_sorted":["cs.DC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-03T12:53:11Z","title_canon_sha256":"b64840ea1d48f6568bdffc41d32986d9695f6c539debd127d584651297aecd56"},"schema_version":"1.0","source":{"id":"2502.01321","kind":"arxiv","version":1}},"canonical_sha256":"71ba50a5bf53a535c6e94d9201022ce62954b30409af99ab0e2eb9770b1f32ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71ba50a5bf53a535c6e94d9201022ce62954b30409af99ab0e2eb9770b1f32ac","first_computed_at":"2026-07-05T10:08:45.695896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:45.695896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nAyr2/gH7gP80XLrjPTxtbp7OSkEieWvXpJ7gnh8mDvVZEKanEAQUw+7ZQVckhkYFe2IcWDEAsx2csPQ9zmHBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:45.696391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ac435f8180bbd19da3e51cd41bf63441fdef702c6518cdfcb82ee5c4065c115","sha256:34d0adebde953359810d920ecf72e5185585326e2b952ac7fd44f2525984ffe6"],"state_sha256":"9e56ab6359b7497d1a51dc9a0edaad902430eed2efaf7cb94a785d8054fc0f96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"As08NdH5BrXTDvq+NdBYyt3d3zDSgJKRqjmGZyK8svzXZYN7w4hX/8jK29Msk5QaJ4yH8CzwrJq1A7KsuGw3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T07:24:31.703826Z","bundle_sha256":"587eb0f63a0d3c9ec7ad96efba09f2ecfb8b5dd81dcb549f16f0cf61022786b2"}}