{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DR7BPDBHDDD2DWSUBUB7YHOW6B","short_pith_number":"pith:DR7BPDBH","canonical_record":{"source":{"id":"1909.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-30T17:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"3747aa0d8beefb72a43fc38e5c6a2a06fa65d7f40bc47241a386699da58bbd5e","abstract_canon_sha256":"bb07416b9c38d662eac282d13c3fc04b6ce75d7755bc19831f81f7a630a3b498"},"schema_version":"1.0"},"canonical_sha256":"1c7e178c2718c7a1da540d03fc1dd6f07cac51813629b0db5fd4f610d3154c58","source":{"kind":"arxiv","id":"1909.01152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01152","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01152v2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01152","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"DR7BPDBHDDD2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"DR7BPDBHDDD2DWSU","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"DR7BPDBH","created_at":"2026-07-05T00:47:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DR7BPDBHDDD2DWSUBUB7YHOW6B","target":"record","payload":{"canonical_record":{"source":{"id":"1909.01152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-30T17:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"3747aa0d8beefb72a43fc38e5c6a2a06fa65d7f40bc47241a386699da58bbd5e","abstract_canon_sha256":"bb07416b9c38d662eac282d13c3fc04b6ce75d7755bc19831f81f7a630a3b498"},"schema_version":"1.0"},"canonical_sha256":"1c7e178c2718c7a1da540d03fc1dd6f07cac51813629b0db5fd4f610d3154c58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:17.391191Z","signature_b64":"7hIsLoAYIOreKaLw5aSLWHExOOt9fMIxlnqYEH04kL6hS8MTU9VSj9MjO1CDQgRJCyA2tWG4k3kC+LwlaK8qAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c7e178c2718c7a1da540d03fc1dd6f07cac51813629b0db5fd4f610d3154c58","last_reissued_at":"2026-07-05T00:47:17.390721Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:17.390721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.01152","source_version":2,"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-05T00:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AiABFLvuPSl4tPbGkD28WR97Q9ZN4k/ojQx2NGWmYr1JIEBmBqTpcl2TlllhpgnRZcdp0idQGlRXWizE7xDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:41:24.672954Z"},"content_sha256":"9408218b0f8e04bcc62ec9fc3efe01c7ea02f390f3a2ac3e128186843837ddd1","schema_version":"1.0","event_id":"sha256:9408218b0f8e04bcc62ec9fc3efe01c7ea02f390f3a2ac3e128186843837ddd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DR7BPDBHDDD2DWSUBUB7YHOW6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Anne-Sophie Himmel, Matthias Bentert, Rolf Niedermeier","submitted_at":"2019-08-30T17:00:31Z","abstract_excerpt":"Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but edge sets changing over time. Taking into account the temporal aspect leads to a rich set of optimization criteria for \"shortest\" walks. Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide an algorithm for computing optimal walks that is capable to deal with various optimization criteria and any linear combination of these. It runs in $O (|V| + |E| \\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01152","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.01152/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-05T00:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vmLT10fZCQYSKRAAZk5Vls786T5xry5ih/XBze4C9jBoT+5cao2zp7pn+D6K7i5IyoRGd1NrpFQsDaw52wvRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:41:24.673405Z"},"content_sha256":"e8c766abd039db7c0cfe6c09c5706cc4280c2b7b952ea55d61d1a32b91095848","schema_version":"1.0","event_id":"sha256:e8c766abd039db7c0cfe6c09c5706cc4280c2b7b952ea55d61d1a32b91095848"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/bundle.json","state_url":"https://pith.science/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/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-07T05:41:24Z","links":{"resolver":"https://pith.science/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B","bundle":"https://pith.science/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/bundle.json","state":"https://pith.science/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DR7BPDBHDDD2DWSUBUB7YHOW6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DR7BPDBHDDD2DWSUBUB7YHOW6B","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":"bb07416b9c38d662eac282d13c3fc04b6ce75d7755bc19831f81f7a630a3b498","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-30T17:00:31Z","title_canon_sha256":"3747aa0d8beefb72a43fc38e5c6a2a06fa65d7f40bc47241a386699da58bbd5e"},"schema_version":"1.0","source":{"id":"1909.01152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01152","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01152v2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01152","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"DR7BPDBHDDD2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"DR7BPDBHDDD2DWSU","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"DR7BPDBH","created_at":"2026-07-05T00:47:17Z"}],"graph_snapshots":[{"event_id":"sha256:e8c766abd039db7c0cfe6c09c5706cc4280c2b7b952ea55d61d1a32b91095848","target":"graph","created_at":"2026-07-05T00:47:17Z","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/1909.01152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but edge sets changing over time. Taking into account the temporal aspect leads to a rich set of optimization criteria for \"shortest\" walks. Extending and significantly broadening state-of-the-art work of Wu et al. [IEEE TKDE 2016], we provide an algorithm for computing optimal walks that is capable to deal with various optimization criteria and any linear combination of these. It runs in $O (|V| + |E| \\log","authors_text":"Andr\\'e Nichterlein, Anne-Sophie Himmel, Matthias Bentert, Rolf Niedermeier","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-30T17:00:31Z","title":"Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01152","kind":"arxiv","version":2},"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:9408218b0f8e04bcc62ec9fc3efe01c7ea02f390f3a2ac3e128186843837ddd1","target":"record","created_at":"2026-07-05T00:47:17Z","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":"bb07416b9c38d662eac282d13c3fc04b6ce75d7755bc19831f81f7a630a3b498","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-30T17:00:31Z","title_canon_sha256":"3747aa0d8beefb72a43fc38e5c6a2a06fa65d7f40bc47241a386699da58bbd5e"},"schema_version":"1.0","source":{"id":"1909.01152","kind":"arxiv","version":2}},"canonical_sha256":"1c7e178c2718c7a1da540d03fc1dd6f07cac51813629b0db5fd4f610d3154c58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c7e178c2718c7a1da540d03fc1dd6f07cac51813629b0db5fd4f610d3154c58","first_computed_at":"2026-07-05T00:47:17.390721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:47:17.390721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7hIsLoAYIOreKaLw5aSLWHExOOt9fMIxlnqYEH04kL6hS8MTU9VSj9MjO1CDQgRJCyA2tWG4k3kC+LwlaK8qAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:47:17.391191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9408218b0f8e04bcc62ec9fc3efe01c7ea02f390f3a2ac3e128186843837ddd1","sha256:e8c766abd039db7c0cfe6c09c5706cc4280c2b7b952ea55d61d1a32b91095848"],"state_sha256":"2438f058f3ac70fbf75e1e0b3c7089a11f8c0b506af5e1d09597068cb4e850b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sw62golGDl4D58249+M09RAQwnrcu24ovamUUOwN9OLrjv0E3pjOZR77ianaAmDdvMT7POPdxpV3tl4GyyCGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:41:24.675962Z","bundle_sha256":"f7afb8a6c2e3dbc720f83ae701f7f5773e46c850479ad221ecfcd6fd472d244b"}}