{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:T4ZN4G2N3PLXOQYFVIDAVIN4W2","short_pith_number":"pith:T4ZN4G2N","schema_version":"1.0","canonical_sha256":"9f32de1b4ddbd7774305aa060aa1bcb698e6bf660688f988b669403e45123cea","source":{"kind":"arxiv","id":"1407.6416","version":1},"attestation_state":"computed","paper":{"title":"On the distance preserving trees in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shingo Osawa, Takashi Shimizu, Toru Araki","submitted_at":"2014-07-24T01:01:35Z","abstract_excerpt":"For a vertex $v$ of a graph $G$, a spanning tree $T$ of $G$ is distance-preserving from $v$ if, for any vertex $w$, the distance from $v$ to $w$ on $T$ is the same as the distance from $v$ to $w$ on $G$. If two vertices $u$ and $v$ are distinct, then two distance-preserving spanning trees $T_{u}$ from $u$ and $T_{v}$ from $v$ are distinct in general. A purpose of this paper is to give a characterization for a given weighted graph $G$ to have a spanning tree $T$ such that $T$ is a distance-preserving spanning tree from distinct two vertices."},"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":"1407.6416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-24T01:01:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e95ed826fffd6716f089cbe1c1e6f4c629557c63cf25da4319f8e0dd071e4a82","abstract_canon_sha256":"2db881bdb3d59daf8aa80b3071b5518fa5af19a63974bd5e1bf66dfacf43039b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:38.779073Z","signature_b64":"g8zFC3ubUn2RaqZnXuZ1EvtLmGgt/6ze4JmmG2omExfxiVYlC78kGqW8vwm0k5o2hSp6/Vsrz4cPEgiQ+zjUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f32de1b4ddbd7774305aa060aa1bcb698e6bf660688f988b669403e45123cea","last_reissued_at":"2026-05-18T02:46:38.778497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:38.778497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the distance preserving trees in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Shingo Osawa, Takashi Shimizu, Toru Araki","submitted_at":"2014-07-24T01:01:35Z","abstract_excerpt":"For a vertex $v$ of a graph $G$, a spanning tree $T$ of $G$ is distance-preserving from $v$ if, for any vertex $w$, the distance from $v$ to $w$ on $T$ is the same as the distance from $v$ to $w$ on $G$. If two vertices $u$ and $v$ are distinct, then two distance-preserving spanning trees $T_{u}$ from $u$ and $T_{v}$ from $v$ are distinct in general. A purpose of this paper is to give a characterization for a given weighted graph $G$ to have a spanning tree $T$ such that $T$ is a distance-preserving spanning tree from distinct two vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6416","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":"1407.6416","created_at":"2026-05-18T02:46:38.778584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6416v1","created_at":"2026-05-18T02:46:38.778584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6416","created_at":"2026-05-18T02:46:38.778584+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4ZN4G2N3PLX","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4ZN4G2N3PLXOQYF","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4ZN4G2N","created_at":"2026-05-18T12:28:49.207871+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/T4ZN4G2N3PLXOQYFVIDAVIN4W2","json":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2.json","graph_json":"https://pith.science/api/pith-number/T4ZN4G2N3PLXOQYFVIDAVIN4W2/graph.json","events_json":"https://pith.science/api/pith-number/T4ZN4G2N3PLXOQYFVIDAVIN4W2/events.json","paper":"https://pith.science/paper/T4ZN4G2N"},"agent_actions":{"view_html":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2","download_json":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2.json","view_paper":"https://pith.science/paper/T4ZN4G2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6416&json=true","fetch_graph":"https://pith.science/api/pith-number/T4ZN4G2N3PLXOQYFVIDAVIN4W2/graph.json","fetch_events":"https://pith.science/api/pith-number/T4ZN4G2N3PLXOQYFVIDAVIN4W2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2/action/storage_attestation","attest_author":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2/action/author_attestation","sign_citation":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2/action/citation_signature","submit_replication":"https://pith.science/pith/T4ZN4G2N3PLXOQYFVIDAVIN4W2/action/replication_record"}},"created_at":"2026-05-18T02:46:38.778584+00:00","updated_at":"2026-05-18T02:46:38.778584+00:00"}