{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEW5PRICLCRS3QEAX634QXPIP6","short_pith_number":"pith:EEW5PRIC","canonical_record":{"source":{"id":"1709.10146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T19:50:10Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"a9437d61d75b52647b9e5c1f8b8e632be2491dc098df92d95e559b2f1a7cfcee","abstract_canon_sha256":"e1a8f1cf673c615301cb38f59960a419e305e38291777072b90466edb89ed098"},"schema_version":"1.0"},"canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","source":{"kind":"arxiv","id":"1709.10146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10146","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10146v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10146","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"EEW5PRICLCRS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEW5PRICLCRS3QEA","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEW5PRIC","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEW5PRICLCRS3QEAX634QXPIP6","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10146","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T19:50:10Z","cross_cats_sorted":["cs.DC","cs.DM"],"title_canon_sha256":"a9437d61d75b52647b9e5c1f8b8e632be2491dc098df92d95e559b2f1a7cfcee","abstract_canon_sha256":"e1a8f1cf673c615301cb38f59960a419e305e38291777072b90466edb89ed098"},"schema_version":"1.0"},"canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.378732Z","signature_b64":"l/D8t5jiXIRynC/bLtB8pI4EQcB7g/rA/AXjoogp2TlkUyTnrhGKaafpHmlVKDba/XXtXeRjLSUEAb380W51DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","last_reissued_at":"2026-05-18T00:23:08.378045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.378045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10146","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-05-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRZjrEWYK5rcL5kkeHrMTK4hd64BZ3Fs8CtWbWd9je/lGYVZyZj6rR9IS4VjKumZ5WQxUN+z4pLbMdAxqdkJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:46.936362Z"},"content_sha256":"330e988ce3a383cb99238f5d9e30c00cdf7d58e3340974658c855da8a7e77281","schema_version":"1.0","event_id":"sha256:330e988ce3a383cb99238f5d9e30c00cdf7d58e3340974658c855da8a7e77281"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEW5PRICLCRS3QEAX634QXPIP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Constrained Depth First Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Dariusz Dereniowski, Przemys{\\l}aw Uzna\\'nski, Shantanu Das","submitted_at":"2017-09-28T19:50:10Z","abstract_excerpt":"Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer $B$ (e.g. due to limited energy resources of the searcher). The objective is to cover all the edges of a tree $T$ using the minimum number of routes, each starting and ending at the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10146","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":""},"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-05-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwsjEXXuDefTplo/C5BWZRiu5OKlBDJ03fx1xKyv561XfiC9u+Flj8CaU/a8M6cFiTs4XK6582VqFt//MUV5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:46.936710Z"},"content_sha256":"a977cc5fad25c822af2f1b4666b6c5c9b8f63ff90f9e655be2612a4c62c07109","schema_version":"1.0","event_id":"sha256:a977cc5fad25c822af2f1b4666b6c5c9b8f63ff90f9e655be2612a4c62c07109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/bundle.json","state_url":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEW5PRICLCRS3QEAX634QXPIP6/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-06-03T19:56:46Z","links":{"resolver":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6","bundle":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/bundle.json","state":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEW5PRICLCRS3QEAX634QXPIP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEW5PRICLCRS3QEAX634QXPIP6","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":"e1a8f1cf673c615301cb38f59960a419e305e38291777072b90466edb89ed098","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T19:50:10Z","title_canon_sha256":"a9437d61d75b52647b9e5c1f8b8e632be2491dc098df92d95e559b2f1a7cfcee"},"schema_version":"1.0","source":{"id":"1709.10146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10146","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10146v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10146","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"EEW5PRICLCRS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEW5PRICLCRS3QEA","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEW5PRIC","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a977cc5fad25c822af2f1b4666b6c5c9b8f63ff90f9e655be2612a4c62c07109","target":"graph","created_at":"2026-05-18T00:23:08Z","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"},"paper":{"abstract_excerpt":"Depth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer $B$ (e.g. due to limited energy resources of the searcher). The objective is to cover all the edges of a tree $T$ using the minimum number of routes, each starting and ending at the","authors_text":"Dariusz Dereniowski, Przemys{\\l}aw Uzna\\'nski, Shantanu Das","cross_cats":["cs.DC","cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T19:50:10Z","title":"Energy Constrained Depth First Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10146","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:330e988ce3a383cb99238f5d9e30c00cdf7d58e3340974658c855da8a7e77281","target":"record","created_at":"2026-05-18T00:23:08Z","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":"e1a8f1cf673c615301cb38f59960a419e305e38291777072b90466edb89ed098","cross_cats_sorted":["cs.DC","cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T19:50:10Z","title_canon_sha256":"a9437d61d75b52647b9e5c1f8b8e632be2491dc098df92d95e559b2f1a7cfcee"},"schema_version":"1.0","source":{"id":"1709.10146","kind":"arxiv","version":2}},"canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","first_computed_at":"2026-05-18T00:23:08.378045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:08.378045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/D8t5jiXIRynC/bLtB8pI4EQcB7g/rA/AXjoogp2TlkUyTnrhGKaafpHmlVKDba/XXtXeRjLSUEAb380W51DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:08.378732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:330e988ce3a383cb99238f5d9e30c00cdf7d58e3340974658c855da8a7e77281","sha256:a977cc5fad25c822af2f1b4666b6c5c9b8f63ff90f9e655be2612a4c62c07109"],"state_sha256":"dcfb8cbf4ebf1cc656c67907f200be7ad208893dcaa79f533be806d30067649a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqeENpAkXLXJ9ySPA12C+lY3dqm8kjjkhQY7Yn20pfCsV9M+v/hyXx+Y5TEtiKE8TISCPIbUrjRRCDbLmgjGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:56:46.938751Z","bundle_sha256":"2ed550cbc9302fda21841c50f81fdc5a790645058caad4804eda0965aea495e2"}}