{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5UDOEDGOSLMNH7O3TFDB7BZZVP","short_pith_number":"pith:5UDOEDGO","schema_version":"1.0","canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","source":{"kind":"arxiv","id":"1511.05109","version":1},"attestation_state":"computed","paper":{"title":"Minimum Eccentricity Shortest Paths in some Structured Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arne Leitert, Feodor F. Dragan","submitted_at":"2015-11-16T20:08:24Z","abstract_excerpt":"We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and give a generalised approach which allows to solve the problem in polynomial time for other graph classes. This includes chordal graphs, dually chordal graphs, graphs with bounded tree-length, and graphs with bounded hype"},"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":"1511.05109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-16T20:08:24Z","cross_cats_sorted":[],"title_canon_sha256":"b28f49b03b79e2603abebf26fb60840a7e1063947ae8eaedfb43d7f92817a07d","abstract_canon_sha256":"8d41c51dde470bf8f60bd2523c24f9aecde553f13e91b32e0670a82392b040d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:50.832122Z","signature_b64":"qJVyMJicOFyW+JHnBl+WcWRm7Lw6gCTL5oUf3616tLv2CMi1uxddspBa1x+ChH+pjR7Ypmqb1V5URaTPJcopCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","last_reissued_at":"2026-05-18T01:26:50.831343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:50.831343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Eccentricity Shortest Paths in some Structured Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arne Leitert, Feodor F. Dragan","submitted_at":"2015-11-16T20:08:24Z","abstract_excerpt":"We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and give a generalised approach which allows to solve the problem in polynomial time for other graph classes. This includes chordal graphs, dually chordal graphs, graphs with bounded tree-length, and graphs with bounded hype"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05109","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":""},"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":"1511.05109","created_at":"2026-05-18T01:26:50.831464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.05109v1","created_at":"2026-05-18T01:26:50.831464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05109","created_at":"2026-05-18T01:26:50.831464+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UDOEDGOSLMN","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UDOEDGOSLMNH7O3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UDOEDGO","created_at":"2026-05-18T12:29:07.941421+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/5UDOEDGOSLMNH7O3TFDB7BZZVP","json":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP.json","graph_json":"https://pith.science/api/pith-number/5UDOEDGOSLMNH7O3TFDB7BZZVP/graph.json","events_json":"https://pith.science/api/pith-number/5UDOEDGOSLMNH7O3TFDB7BZZVP/events.json","paper":"https://pith.science/paper/5UDOEDGO"},"agent_actions":{"view_html":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP","download_json":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP.json","view_paper":"https://pith.science/paper/5UDOEDGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.05109&json=true","fetch_graph":"https://pith.science/api/pith-number/5UDOEDGOSLMNH7O3TFDB7BZZVP/graph.json","fetch_events":"https://pith.science/api/pith-number/5UDOEDGOSLMNH7O3TFDB7BZZVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/action/storage_attestation","attest_author":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/action/author_attestation","sign_citation":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/action/citation_signature","submit_replication":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/action/replication_record"}},"created_at":"2026-05-18T01:26:50.831464+00:00","updated_at":"2026-05-18T01:26:50.831464+00:00"}