{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EEW5PRICLCRS3QEAX634QXPIP6","short_pith_number":"pith:EEW5PRIC","schema_version":"1.0","canonical_sha256":"212dd7c50258a32dc080bfb7c85de87fac258707e7e5092705d45edc149bc568","source":{"kind":"arxiv","id":"1709.10146","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.10146","created_at":"2026-05-18T00:23:08.378145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10146v2","created_at":"2026-05-18T00:23:08.378145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10146","created_at":"2026-05-18T00:23:08.378145+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEW5PRICLCRS","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEW5PRICLCRS3QEA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEW5PRIC","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6","json":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6.json","graph_json":"https://pith.science/api/pith-number/EEW5PRICLCRS3QEAX634QXPIP6/graph.json","events_json":"https://pith.science/api/pith-number/EEW5PRICLCRS3QEAX634QXPIP6/events.json","paper":"https://pith.science/paper/EEW5PRIC"},"agent_actions":{"view_html":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6","download_json":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6.json","view_paper":"https://pith.science/paper/EEW5PRIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10146&json=true","fetch_graph":"https://pith.science/api/pith-number/EEW5PRICLCRS3QEAX634QXPIP6/graph.json","fetch_events":"https://pith.science/api/pith-number/EEW5PRICLCRS3QEAX634QXPIP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/action/storage_attestation","attest_author":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/action/author_attestation","sign_citation":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/action/citation_signature","submit_replication":"https://pith.science/pith/EEW5PRICLCRS3QEAX634QXPIP6/action/replication_record"}},"created_at":"2026-05-18T00:23:08.378145+00:00","updated_at":"2026-05-18T00:23:08.378145+00:00"}