{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ANAORN6BUBHCJKNEZS2GQZW54U","short_pith_number":"pith:ANAORN6B","canonical_record":{"source":{"id":"2302.10110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-20T17:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"094e7fc620c6d6cca2e409065f75e0aa2c3aef736ec7ed5c84d1b54b96750912","abstract_canon_sha256":"6b44938e946119cc78ba015beaa140b06a172166777f9d710752195ea2d1929f"},"schema_version":"1.0"},"canonical_sha256":"0340e8b7c1a04e24a9a4ccb46866dde5391333c9d4164f164a2d08f4f3311778","source":{"kind":"arxiv","id":"2302.10110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10110","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10110v1","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10110","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"ANAORN6BUBHC","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_16","alias_value":"ANAORN6BUBHCJKNE","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_8","alias_value":"ANAORN6B","created_at":"2026-07-05T05:43:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ANAORN6BUBHCJKNEZS2GQZW54U","target":"record","payload":{"canonical_record":{"source":{"id":"2302.10110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-20T17:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"094e7fc620c6d6cca2e409065f75e0aa2c3aef736ec7ed5c84d1b54b96750912","abstract_canon_sha256":"6b44938e946119cc78ba015beaa140b06a172166777f9d710752195ea2d1929f"},"schema_version":"1.0"},"canonical_sha256":"0340e8b7c1a04e24a9a4ccb46866dde5391333c9d4164f164a2d08f4f3311778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:43:33.298774Z","signature_b64":"o5heNPEz8JwOM7k7WnBhRlPiEr6wqNz/fKuVE0UOlYlPXnMDwgYotbILzTyzOhQbjUPnF7EoBDUbb1MzOs0aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0340e8b7c1a04e24a9a4ccb46866dde5391333c9d4164f164a2d08f4f3311778","last_reissued_at":"2026-07-05T05:43:33.298281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:43:33.298281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.10110","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-05T05:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwW6Om828/hmeML0X3/ATIXGH2m3E/D+XKuisocacrgN4/lEmPlygcuMjSfmwjJasXPQ5sWWQXr+4YUvNAVqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:00:47.991190Z"},"content_sha256":"d8768a9287badf4c0a28b7781952eec1677f2162a84fcc0dd42fca5044550ce5","schema_version":"1.0","event_id":"sha256:d8768a9287badf4c0a28b7781952eec1677f2162a84fcc0dd42fca5044550ce5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ANAORN6BUBHCJKNEZS2GQZW54U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kernelizing Temporal Exploration Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Emmanuel Arrighi, Fedor V. Fomin, Petra Wolf, Petr Golovach","submitted_at":"2023-02-20T17:14:06Z","abstract_excerpt":"We study the kernelization of exploration problems on temporal graphs. A temporal graph consists of a finite sequence of snapshot graphs $\\mathcal{G}=(G_1, G_2, \\dots, G_L)$ that share a common vertex set but might have different edge sets.\n  The non-strict temporal exploration problem (NS-TEXP for short) introduced by Erlebach and Spooner, asks if a single agent can visit all vertices of a given temporal graph where the edges traversed by the agent are present in non-strict monotonous time steps, i.e., the agent can move along the edges of a snapshot graph with infinite speed. The exploration"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10110","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/2302.10110/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-05T05:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msu1z/MFvFvUkXNANhS4Hx9T/m3Oj19bNzYyPFcDlLE5FIm5XaYndaLKPR1ydI2BSJD0vzRicajvNh+joFBYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:00:47.991965Z"},"content_sha256":"fe2edf1500b59c539b064de5c42f71ffa968e04116c412dbcd9c19eea5ecb05c","schema_version":"1.0","event_id":"sha256:fe2edf1500b59c539b064de5c42f71ffa968e04116c412dbcd9c19eea5ecb05c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANAORN6BUBHCJKNEZS2GQZW54U/bundle.json","state_url":"https://pith.science/pith/ANAORN6BUBHCJKNEZS2GQZW54U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANAORN6BUBHCJKNEZS2GQZW54U/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-20T20:00:47Z","links":{"resolver":"https://pith.science/pith/ANAORN6BUBHCJKNEZS2GQZW54U","bundle":"https://pith.science/pith/ANAORN6BUBHCJKNEZS2GQZW54U/bundle.json","state":"https://pith.science/pith/ANAORN6BUBHCJKNEZS2GQZW54U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANAORN6BUBHCJKNEZS2GQZW54U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ANAORN6BUBHCJKNEZS2GQZW54U","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":"6b44938e946119cc78ba015beaa140b06a172166777f9d710752195ea2d1929f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-20T17:14:06Z","title_canon_sha256":"094e7fc620c6d6cca2e409065f75e0aa2c3aef736ec7ed5c84d1b54b96750912"},"schema_version":"1.0","source":{"id":"2302.10110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10110","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10110v1","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10110","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"ANAORN6BUBHC","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_16","alias_value":"ANAORN6BUBHCJKNE","created_at":"2026-07-05T05:43:33Z"},{"alias_kind":"pith_short_8","alias_value":"ANAORN6B","created_at":"2026-07-05T05:43:33Z"}],"graph_snapshots":[{"event_id":"sha256:fe2edf1500b59c539b064de5c42f71ffa968e04116c412dbcd9c19eea5ecb05c","target":"graph","created_at":"2026-07-05T05:43:33Z","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/2302.10110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the kernelization of exploration problems on temporal graphs. A temporal graph consists of a finite sequence of snapshot graphs $\\mathcal{G}=(G_1, G_2, \\dots, G_L)$ that share a common vertex set but might have different edge sets.\n  The non-strict temporal exploration problem (NS-TEXP for short) introduced by Erlebach and Spooner, asks if a single agent can visit all vertices of a given temporal graph where the edges traversed by the agent are present in non-strict monotonous time steps, i.e., the agent can move along the edges of a snapshot graph with infinite speed. The exploration","authors_text":"Emmanuel Arrighi, Fedor V. Fomin, Petra Wolf, Petr Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-20T17:14:06Z","title":"Kernelizing Temporal Exploration Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10110","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:d8768a9287badf4c0a28b7781952eec1677f2162a84fcc0dd42fca5044550ce5","target":"record","created_at":"2026-07-05T05:43:33Z","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":"6b44938e946119cc78ba015beaa140b06a172166777f9d710752195ea2d1929f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-02-20T17:14:06Z","title_canon_sha256":"094e7fc620c6d6cca2e409065f75e0aa2c3aef736ec7ed5c84d1b54b96750912"},"schema_version":"1.0","source":{"id":"2302.10110","kind":"arxiv","version":1}},"canonical_sha256":"0340e8b7c1a04e24a9a4ccb46866dde5391333c9d4164f164a2d08f4f3311778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0340e8b7c1a04e24a9a4ccb46866dde5391333c9d4164f164a2d08f4f3311778","first_computed_at":"2026-07-05T05:43:33.298281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:43:33.298281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o5heNPEz8JwOM7k7WnBhRlPiEr6wqNz/fKuVE0UOlYlPXnMDwgYotbILzTyzOhQbjUPnF7EoBDUbb1MzOs0aAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:43:33.298774Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.10110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8768a9287badf4c0a28b7781952eec1677f2162a84fcc0dd42fca5044550ce5","sha256:fe2edf1500b59c539b064de5c42f71ffa968e04116c412dbcd9c19eea5ecb05c"],"state_sha256":"73b233d8bd87ef75ba15f936f05cacb692c91338778fa61fe41d684c3c23840f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEdCsYSW87GC/98Kxo47I3kRH56u8VrJgVaJPkmzbhnInXgrODzxMKY/0oidixjEEJ7dzFk0t/kQ4dFalbWHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:00:47.997118Z","bundle_sha256":"bb226f6a129b3182d4b8d7f482dd01c396953166c862efe5a6dcc34c46556abd"}}