{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XTVL4PYHFXQ7WCVWFDYU74SXBW","short_pith_number":"pith:XTVL4PYH","canonical_record":{"source":{"id":"1407.0048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T20:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"e6bed242abca741abdd9b8e3f57d6febfdf4864a237d64986cecfbe9a1d613de","abstract_canon_sha256":"1870d147a88d2713d5f8e357ef5516bdb6d152c5c52df47fcf4caa68468cf5de"},"schema_version":"1.0"},"canonical_sha256":"bceabe3f072de1fb0ab628f14ff2570db9851304e8850dde35f322ce07a5ace8","source":{"kind":"arxiv","id":"1407.0048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0048","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0048v1","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0048","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"XTVL4PYHFXQ7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XTVL4PYHFXQ7WCVW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XTVL4PYH","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XTVL4PYHFXQ7WCVWFDYU74SXBW","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T20:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"e6bed242abca741abdd9b8e3f57d6febfdf4864a237d64986cecfbe9a1d613de","abstract_canon_sha256":"1870d147a88d2713d5f8e357ef5516bdb6d152c5c52df47fcf4caa68468cf5de"},"schema_version":"1.0"},"canonical_sha256":"bceabe3f072de1fb0ab628f14ff2570db9851304e8850dde35f322ce07a5ace8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:35.371301Z","signature_b64":"/Cs7Wt9uodKWeHIiGj/6fQAJQVDfD7pJdeC8OEAkIIeNfMbotVeeTr9A6YP+BP8BglTQdJ+4IW+U4ONXdCFgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bceabe3f072de1fb0ab628f14ff2570db9851304e8850dde35f322ce07a5ace8","last_reissued_at":"2026-05-18T02:48:35.370725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:35.370725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0048","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-18T02:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0sG064UQWPe3WsGuvpo7Nc5duCXIYXLbHRGppAMViEhgHKlL9UyRStLBhGrDFgsDV5wYn5SFmvQkFZsOx8RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:57:56.718065Z"},"content_sha256":"a88465455bc96b4593144719a293fbe94952e29ecac2cdc7906eed3d92c00c4b","schema_version":"1.0","event_id":"sha256:a88465455bc96b4593144719a293fbe94952e29ecac2cdc7906eed3d92c00c4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XTVL4PYHFXQ7WCVWFDYU74SXBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Buneman's theorem for trees with exatcly n vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Agnese Baldisserri","submitted_at":"2014-06-30T20:27:42Z","abstract_excerpt":"Let ${\\cal T}=(T,w)$ be a positive-weighted tree with at least $n$ vertices. For any $i,j \\in \\{1,...,n\\}$, let $D_{i,j} ({\\cal T})$ be the weight of the unique path in $T$ connecting $i$ and $j$. The $D_{i,j} ({\\cal T})$ are called $2$-weights of ${\\cal T}$ and, if we put in order the $2$-weights, the vector which has the $D_{i,j} ({\\cal T})$ as components is called \\emph{$2$-dissimilarity vector} of $ {\\cal T}$. Given a family of positive real numbers $\\{D_{i,j}\\}_{i,j \\in \\{1,...,n\\}}$, we say that a positive-weighted tree ${\\cal T}=(T,w)$ realizes the family if $\\{1,...,n\\} \\subset V(T)$ a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0048","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-18T02:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwPlcM18MKBrSLnZEeGp+ogdhreWDXgECMJ7if1DJsV6aKyc2yMPhy2enlgBZ+ZRZjjAHyNo7DG5d9hKLpwzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:57:56.718420Z"},"content_sha256":"0a1bdf7e4152e90f80dab61be21f690c19f3be331d7f672a0547db3123a0da27","schema_version":"1.0","event_id":"sha256:0a1bdf7e4152e90f80dab61be21f690c19f3be331d7f672a0547db3123a0da27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/bundle.json","state_url":"https://pith.science/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/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-22T20:57:56Z","links":{"resolver":"https://pith.science/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW","bundle":"https://pith.science/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/bundle.json","state":"https://pith.science/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTVL4PYHFXQ7WCVWFDYU74SXBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XTVL4PYHFXQ7WCVWFDYU74SXBW","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":"1870d147a88d2713d5f8e357ef5516bdb6d152c5c52df47fcf4caa68468cf5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T20:27:42Z","title_canon_sha256":"e6bed242abca741abdd9b8e3f57d6febfdf4864a237d64986cecfbe9a1d613de"},"schema_version":"1.0","source":{"id":"1407.0048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0048","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0048v1","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0048","created_at":"2026-05-18T02:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"XTVL4PYHFXQ7","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XTVL4PYHFXQ7WCVW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XTVL4PYH","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:0a1bdf7e4152e90f80dab61be21f690c19f3be331d7f672a0547db3123a0da27","target":"graph","created_at":"2026-05-18T02:48:35Z","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":"Let ${\\cal T}=(T,w)$ be a positive-weighted tree with at least $n$ vertices. For any $i,j \\in \\{1,...,n\\}$, let $D_{i,j} ({\\cal T})$ be the weight of the unique path in $T$ connecting $i$ and $j$. The $D_{i,j} ({\\cal T})$ are called $2$-weights of ${\\cal T}$ and, if we put in order the $2$-weights, the vector which has the $D_{i,j} ({\\cal T})$ as components is called \\emph{$2$-dissimilarity vector} of $ {\\cal T}$. Given a family of positive real numbers $\\{D_{i,j}\\}_{i,j \\in \\{1,...,n\\}}$, we say that a positive-weighted tree ${\\cal T}=(T,w)$ realizes the family if $\\{1,...,n\\} \\subset V(T)$ a","authors_text":"Agnese Baldisserri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T20:27:42Z","title":"Buneman's theorem for trees with exatcly n vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0048","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:a88465455bc96b4593144719a293fbe94952e29ecac2cdc7906eed3d92c00c4b","target":"record","created_at":"2026-05-18T02:48:35Z","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":"1870d147a88d2713d5f8e357ef5516bdb6d152c5c52df47fcf4caa68468cf5de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-30T20:27:42Z","title_canon_sha256":"e6bed242abca741abdd9b8e3f57d6febfdf4864a237d64986cecfbe9a1d613de"},"schema_version":"1.0","source":{"id":"1407.0048","kind":"arxiv","version":1}},"canonical_sha256":"bceabe3f072de1fb0ab628f14ff2570db9851304e8850dde35f322ce07a5ace8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bceabe3f072de1fb0ab628f14ff2570db9851304e8850dde35f322ce07a5ace8","first_computed_at":"2026-05-18T02:48:35.370725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:35.370725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Cs7Wt9uodKWeHIiGj/6fQAJQVDfD7pJdeC8OEAkIIeNfMbotVeeTr9A6YP+BP8BglTQdJ+4IW+U4ONXdCFgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:35.371301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a88465455bc96b4593144719a293fbe94952e29ecac2cdc7906eed3d92c00c4b","sha256:0a1bdf7e4152e90f80dab61be21f690c19f3be331d7f672a0547db3123a0da27"],"state_sha256":"f3a0535efd2f64ea50768e9bda00c5c55e65ccc5df535d8e7694c06984796e21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2T0L07/T3/CyAKBmsu0YlJCG4GO16hUXbEHeTLeraf9wkliDR+7UrXpAjznE7QEHJS5BLtx9a3WCt9UvEPAhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:57:56.720428Z","bundle_sha256":"9c76981a653ba3dc18a54ea2377acd0e7fe758aea4423cb8337146bee27e9595"}}