{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7EB5RCH4REYYAEQGRQWOD3GM2B","short_pith_number":"pith:7EB5RCH4","canonical_record":{"source":{"id":"2505.14046","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T07:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"50b784af0d914ab330bd1851f59d86e8a0229bf30d2507455f437b2e645e6333","abstract_canon_sha256":"64aa1939c35061feacaf166f22a0d924225d17e7dab5a7cc254bdd715ea45ff4"},"schema_version":"1.0"},"canonical_sha256":"f903d888fc89318012068c2ce1ecccd047cb87427d60ad486625e0aed2bb7c6a","source":{"kind":"arxiv","id":"2505.14046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14046","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14046v1","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14046","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"7EB5RCH4REYY","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"7EB5RCH4REYYAEQG","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"7EB5RCH4","created_at":"2026-07-05T11:05:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7EB5RCH4REYYAEQGRQWOD3GM2B","target":"record","payload":{"canonical_record":{"source":{"id":"2505.14046","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T07:44:36Z","cross_cats_sorted":[],"title_canon_sha256":"50b784af0d914ab330bd1851f59d86e8a0229bf30d2507455f437b2e645e6333","abstract_canon_sha256":"64aa1939c35061feacaf166f22a0d924225d17e7dab5a7cc254bdd715ea45ff4"},"schema_version":"1.0"},"canonical_sha256":"f903d888fc89318012068c2ce1ecccd047cb87427d60ad486625e0aed2bb7c6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:55.244734Z","signature_b64":"8z6QfxMd18iiedfJ9BE3A5KlavFOVbwsCzXHj1lAQFRN3/EJjQ6FVQEFWi5xwfFipiHAa3R6rDIIC3XlwB0/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f903d888fc89318012068c2ce1ecccd047cb87427d60ad486625e0aed2bb7c6a","last_reissued_at":"2026-07-05T11:05:55.244171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:55.244171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.14046","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-05T11:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQhL1r3mkU8cyhK9ZsOzaNnoN7p42CGoFJuFYyUKOcKXFVlzbcFR+avPIlTTz57k+iWKG18idisW+qI/lEavBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:34:23.657761Z"},"content_sha256":"fc2e16893a4878901f6e267e85be7c6517f74f36662abaca7323a577bcc532ff","schema_version":"1.0","event_id":"sha256:fc2e16893a4878901f6e267e85be7c6517f74f36662abaca7323a577bcc532ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7EB5RCH4REYYAEQGRQWOD3GM2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Temporal Graphs with Frequent and Regular Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Duncan Adamson","submitted_at":"2025-05-20T07:44:36Z","abstract_excerpt":"Temporal graphs are a class of graphs defined by a constant set of vertices and a changing set of edges, each of which is known as a timestep. These graphs are well motivated in modelling real-world networks, where connections may change over time. One such example, itself the primary motivation for this paper, are public transport networks, where vertices represent stops and edges the connections available at some given time. Exploration problems are one of the most studied problems for temporal graphs, asking if an agent starting at some given vertex $v$ can visit every vertex in the graph.\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14046","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/2505.14046/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-05T11:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3PXsVV9tGcaBC9ekF2pwAtWowUG4qTO9DFkr8edlySZlJkyDV/e5FGBk+R6Wb5NMRtsAuNabkZHX4UkAknLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:34:23.658617Z"},"content_sha256":"78f539800c7db1b02632a9e26e739816d76d848495d2e6a6a9ededcbfef7a7ce","schema_version":"1.0","event_id":"sha256:78f539800c7db1b02632a9e26e739816d76d848495d2e6a6a9ededcbfef7a7ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/bundle.json","state_url":"https://pith.science/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/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-08-20T10:34:23Z","links":{"resolver":"https://pith.science/pith/7EB5RCH4REYYAEQGRQWOD3GM2B","bundle":"https://pith.science/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/bundle.json","state":"https://pith.science/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EB5RCH4REYYAEQGRQWOD3GM2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7EB5RCH4REYYAEQGRQWOD3GM2B","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":"64aa1939c35061feacaf166f22a0d924225d17e7dab5a7cc254bdd715ea45ff4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T07:44:36Z","title_canon_sha256":"50b784af0d914ab330bd1851f59d86e8a0229bf30d2507455f437b2e645e6333"},"schema_version":"1.0","source":{"id":"2505.14046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14046","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14046v1","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14046","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"7EB5RCH4REYY","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"7EB5RCH4REYYAEQG","created_at":"2026-07-05T11:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"7EB5RCH4","created_at":"2026-07-05T11:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:78f539800c7db1b02632a9e26e739816d76d848495d2e6a6a9ededcbfef7a7ce","target":"graph","created_at":"2026-07-05T11:05:55Z","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/2505.14046/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal graphs are a class of graphs defined by a constant set of vertices and a changing set of edges, each of which is known as a timestep. These graphs are well motivated in modelling real-world networks, where connections may change over time. One such example, itself the primary motivation for this paper, are public transport networks, where vertices represent stops and edges the connections available at some given time. Exploration problems are one of the most studied problems for temporal graphs, asking if an agent starting at some given vertex $v$ can visit every vertex in the graph.\n","authors_text":"Duncan Adamson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14046","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:fc2e16893a4878901f6e267e85be7c6517f74f36662abaca7323a577bcc532ff","target":"record","created_at":"2026-07-05T11:05:55Z","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":"64aa1939c35061feacaf166f22a0d924225d17e7dab5a7cc254bdd715ea45ff4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-20T07:44:36Z","title_canon_sha256":"50b784af0d914ab330bd1851f59d86e8a0229bf30d2507455f437b2e645e6333"},"schema_version":"1.0","source":{"id":"2505.14046","kind":"arxiv","version":1}},"canonical_sha256":"f903d888fc89318012068c2ce1ecccd047cb87427d60ad486625e0aed2bb7c6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f903d888fc89318012068c2ce1ecccd047cb87427d60ad486625e0aed2bb7c6a","first_computed_at":"2026-07-05T11:05:55.244171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:55.244171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8z6QfxMd18iiedfJ9BE3A5KlavFOVbwsCzXHj1lAQFRN3/EJjQ6FVQEFWi5xwfFipiHAa3R6rDIIC3XlwB0/Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:55.244734Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc2e16893a4878901f6e267e85be7c6517f74f36662abaca7323a577bcc532ff","sha256:78f539800c7db1b02632a9e26e739816d76d848495d2e6a6a9ededcbfef7a7ce"],"state_sha256":"c7acf992c73939e1bfd79aa1a298420e01431d3b27b85710ec706e248f18d25b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHaiEUYkvCxaoE6w8sMxiYfEBwh1og/v98QXVqTiwo0/+FE+UsPbxDepVSJVt85ei3SR/pne4SBT9Y2xYr7KBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:34:23.665043Z","bundle_sha256":"4633f13436a054ff0ab99ead16e701ba9a62519f2bf42e42db015df720b8431e"}}