{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VS53CVCMP4O2OGUOONTLSKOJRV","short_pith_number":"pith:VS53CVCM","schema_version":"1.0","canonical_sha256":"acbbb1544c7f1da71a8e7366b929c98d481351fcbb14a50eed1c71ff109e5504","source":{"kind":"arxiv","id":"1108.0290","version":2},"attestation_state":"computed","paper":{"title":"Optimal realisations of two-dimensional, totally-decomposable metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alice Lesser, Jack Koolen, Sven Herrmann, Taoyang Wu, Vincent Moulton","submitted_at":"2011-08-01T11:51:48Z","abstract_excerpt":"A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation $(G,w)$ is called optimal if the sum of its edge weights is minimal over all such realisations. Optimal realisations always exist, although it is NP-hard to compute them in general, and they have applications in areas such as phylogenetics, electrical networks and internet tomography. In [Adv. in Math. 53, 1984, 321-402] A.~Dress showed that the optimal realisati"},"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":"1108.0290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-01T11:51:48Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"10d5b9186e1d530b2264cf645456fe7a29340309ca9b42853f5d6b84a10e2d89","abstract_canon_sha256":"eaf98e7bc430650f4190c88e57733d5065b403b7517d0658fcf0b5a2a9c2720b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:50.188480Z","signature_b64":"rmhJNX9OS7Nz3K/t1JIuiMenrRak5RVz8d1fdXP+wD198VaCAvlrgJrOsbdd6oxDoQWGLFytF3Tl5z89dvhwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acbbb1544c7f1da71a8e7366b929c98d481351fcbb14a50eed1c71ff109e5504","last_reissued_at":"2026-05-18T02:27:50.188049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:50.188049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal realisations of two-dimensional, totally-decomposable metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Alice Lesser, Jack Koolen, Sven Herrmann, Taoyang Wu, Vincent Moulton","submitted_at":"2011-08-01T11:51:48Z","abstract_excerpt":"A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation $(G,w)$ is called optimal if the sum of its edge weights is minimal over all such realisations. Optimal realisations always exist, although it is NP-hard to compute them in general, and they have applications in areas such as phylogenetics, electrical networks and internet tomography. In [Adv. in Math. 53, 1984, 321-402] A.~Dress showed that the optimal realisati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0290","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":"1108.0290","created_at":"2026-05-18T02:27:50.188114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.0290v2","created_at":"2026-05-18T02:27:50.188114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0290","created_at":"2026-05-18T02:27:50.188114+00:00"},{"alias_kind":"pith_short_12","alias_value":"VS53CVCMP4O2","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VS53CVCMP4O2OGUO","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VS53CVCM","created_at":"2026-05-18T12:26:44.992195+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/VS53CVCMP4O2OGUOONTLSKOJRV","json":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV.json","graph_json":"https://pith.science/api/pith-number/VS53CVCMP4O2OGUOONTLSKOJRV/graph.json","events_json":"https://pith.science/api/pith-number/VS53CVCMP4O2OGUOONTLSKOJRV/events.json","paper":"https://pith.science/paper/VS53CVCM"},"agent_actions":{"view_html":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV","download_json":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV.json","view_paper":"https://pith.science/paper/VS53CVCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.0290&json=true","fetch_graph":"https://pith.science/api/pith-number/VS53CVCMP4O2OGUOONTLSKOJRV/graph.json","fetch_events":"https://pith.science/api/pith-number/VS53CVCMP4O2OGUOONTLSKOJRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV/action/storage_attestation","attest_author":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV/action/author_attestation","sign_citation":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV/action/citation_signature","submit_replication":"https://pith.science/pith/VS53CVCMP4O2OGUOONTLSKOJRV/action/replication_record"}},"created_at":"2026-05-18T02:27:50.188114+00:00","updated_at":"2026-05-18T02:27:50.188114+00:00"}