{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5UDOEDGOSLMNH7O3TFDB7BZZVP","short_pith_number":"pith:5UDOEDGO","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"},"canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","source":{"kind":"arxiv","id":"1511.05109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05109","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05109v1","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05109","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"5UDOEDGOSLMN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5UDOEDGOSLMNH7O3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5UDOEDGO","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5UDOEDGOSLMNH7O3TFDB7BZZVP","target":"record","payload":{"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"},"canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","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"},"source_kind":"arxiv","source_id":"1511.05109","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-05-18T01:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xk3ocpuhFY09FsqTMrg27Cg8C91WyUdnUZQldcSR0Rri5fm3RP9tff5vodpj8QdP1ZLvfIjBbGGLmRsv6IkhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:22:37.094457Z"},"content_sha256":"7ca757ff716d6a28a69da42c530861b3c9ea65174a8a7619e42599987023b381","schema_version":"1.0","event_id":"sha256:7ca757ff716d6a28a69da42c530861b3c9ea65174a8a7619e42599987023b381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5UDOEDGOSLMNH7O3TFDB7BZZVP","target":"graph","payload":{"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"},"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-18T01:26:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8w8zVbvB1aj/I9DnTKBZOFlH4PScKa/Jy6xQoHvs/EbedmorBVJ6ls7xLEPiXH287AKQi7507jHsXHt93/jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T00:22:37.094799Z"},"content_sha256":"ebc3a1a5d34b87d74e4bc307838026db2e5ac32ca713eeda0232c580681ba8b6","schema_version":"1.0","event_id":"sha256:ebc3a1a5d34b87d74e4bc307838026db2e5ac32ca713eeda0232c580681ba8b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/bundle.json","state_url":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/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-22T00:22:37Z","links":{"resolver":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP","bundle":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/bundle.json","state":"https://pith.science/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UDOEDGOSLMNH7O3TFDB7BZZVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5UDOEDGOSLMNH7O3TFDB7BZZVP","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":"8d41c51dde470bf8f60bd2523c24f9aecde553f13e91b32e0670a82392b040d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-16T20:08:24Z","title_canon_sha256":"b28f49b03b79e2603abebf26fb60840a7e1063947ae8eaedfb43d7f92817a07d"},"schema_version":"1.0","source":{"id":"1511.05109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05109","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05109v1","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05109","created_at":"2026-05-18T01:26:50Z"},{"alias_kind":"pith_short_12","alias_value":"5UDOEDGOSLMN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5UDOEDGOSLMNH7O3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5UDOEDGO","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:ebc3a1a5d34b87d74e4bc307838026db2e5ac32ca713eeda0232c580681ba8b6","target":"graph","created_at":"2026-05-18T01:26:50Z","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":"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","authors_text":"Arne Leitert, Feodor F. Dragan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-16T20:08:24Z","title":"Minimum Eccentricity Shortest Paths in some Structured Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05109","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:7ca757ff716d6a28a69da42c530861b3c9ea65174a8a7619e42599987023b381","target":"record","created_at":"2026-05-18T01:26:50Z","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":"8d41c51dde470bf8f60bd2523c24f9aecde553f13e91b32e0670a82392b040d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-11-16T20:08:24Z","title_canon_sha256":"b28f49b03b79e2603abebf26fb60840a7e1063947ae8eaedfb43d7f92817a07d"},"schema_version":"1.0","source":{"id":"1511.05109","kind":"arxiv","version":1}},"canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed06e20cce92d8d3fddb99461f8739abc827247dacffea0d0512d9097adaeb0d","first_computed_at":"2026-05-18T01:26:50.831343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:50.831343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJVyMJicOFyW+JHnBl+WcWRm7Lw6gCTL5oUf3616tLv2CMi1uxddspBa1x+ChH+pjR7Ypmqb1V5URaTPJcopCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:50.832122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ca757ff716d6a28a69da42c530861b3c9ea65174a8a7619e42599987023b381","sha256:ebc3a1a5d34b87d74e4bc307838026db2e5ac32ca713eeda0232c580681ba8b6"],"state_sha256":"01c9e50c0862f17518cb1ce4627d5aab97dc988095d756f3e9608b7ac400f409"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhkB8b799JWMX6enBPrvUMMIcLhUgRQH9TiYCycT/PyeoCBuloLS0XKXXtBdQWlindBaXsk83halF0AbACSYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T00:22:37.097079Z","bundle_sha256":"e2576ac7f1f7730978555061058a8a3c32e0f129240caf21a9d3473395905a56"}}