{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AUGXVCBIVPRAVSOHYL6STA2TDG","short_pith_number":"pith:AUGXVCBI","canonical_record":{"source":{"id":"1707.07908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-25T10:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"d0b037a81bb85ed8242005d6fd019ead03b00c61bde2d3aaa4297d1fd5cf1b00","abstract_canon_sha256":"b82eeab06ec8ce47976ce540ce863763f2766b7588d1f7204cdd0726651507cc"},"schema_version":"1.0"},"canonical_sha256":"050d7a8828abe20ac9c7c2fd298353198939b64a1e5c7adcd3a55890da867290","source":{"kind":"arxiv","id":"1707.07908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07908","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07908v1","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07908","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"AUGXVCBIVPRA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AUGXVCBIVPRAVSOH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AUGXVCBI","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AUGXVCBIVPRAVSOHYL6STA2TDG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-25T10:44:48Z","cross_cats_sorted":[],"title_canon_sha256":"d0b037a81bb85ed8242005d6fd019ead03b00c61bde2d3aaa4297d1fd5cf1b00","abstract_canon_sha256":"b82eeab06ec8ce47976ce540ce863763f2766b7588d1f7204cdd0726651507cc"},"schema_version":"1.0"},"canonical_sha256":"050d7a8828abe20ac9c7c2fd298353198939b64a1e5c7adcd3a55890da867290","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:29.930925Z","signature_b64":"/+nFOr2P5vP5Ozs1bkBRXHNTiUKTrG3ULZuK/sP83Soilqir5152DIcDtZ/MYJXz1v/4/82OORJMZbbNiSt6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"050d7a8828abe20ac9c7c2fd298353198939b64a1e5c7adcd3a55890da867290","last_reissued_at":"2026-05-18T00:39:29.930297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:29.930297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07908","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-18T00:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bfG7IcHfGjRL3v2ka/TA/d+vNXeX+TaQOmI0C9X/3vop8hwxA7uCW8J/XKEE/3uZKdVcwp8kPwCbjwG+JZQlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:27.857501Z"},"content_sha256":"033e573bd31237051deecdb17b768a17d38a239b0540951a280384756448b502","schema_version":"1.0","event_id":"sha256:033e573bd31237051deecdb17b768a17d38a239b0540951a280384756448b502"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AUGXVCBIVPRAVSOHYL6STA2TDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial properties of triplet covers for binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katharina T. Huber, Mike Steel, Stefan Gruenewald, Vincent Moulton","submitted_at":"2017-07-25T10:44:48Z","abstract_excerpt":"It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$ has degree 3 then the number of distance values required is linear in the number of leaves. A canonical candidate for such a set of pairs of leaves in $T$ is the following: for each non-leaf vertex $v$, choose a leaf in each of the three components of $T-v$, group these three leaves into three pairs, and take the union of this set over all choices of $v$. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07908","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-18T00:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdnbBLsEauQv+dpe4podanU/xBRZDlY4NKQe0Tr9fQhmZ5Ah/nG8lup2Z3idIFd6NGX2Xrzxho3pSRgDCTH9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:22:27.857852Z"},"content_sha256":"7224eb23782b577c0e287a495a1b262bd52252e473e21c6a3f9deacc9cf62cc7","schema_version":"1.0","event_id":"sha256:7224eb23782b577c0e287a495a1b262bd52252e473e21c6a3f9deacc9cf62cc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/bundle.json","state_url":"https://pith.science/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/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-05-31T11:22:27Z","links":{"resolver":"https://pith.science/pith/AUGXVCBIVPRAVSOHYL6STA2TDG","bundle":"https://pith.science/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/bundle.json","state":"https://pith.science/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUGXVCBIVPRAVSOHYL6STA2TDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AUGXVCBIVPRAVSOHYL6STA2TDG","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":"b82eeab06ec8ce47976ce540ce863763f2766b7588d1f7204cdd0726651507cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-25T10:44:48Z","title_canon_sha256":"d0b037a81bb85ed8242005d6fd019ead03b00c61bde2d3aaa4297d1fd5cf1b00"},"schema_version":"1.0","source":{"id":"1707.07908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07908","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07908v1","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07908","created_at":"2026-05-18T00:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"AUGXVCBIVPRA","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AUGXVCBIVPRAVSOH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AUGXVCBI","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:7224eb23782b577c0e287a495a1b262bd52252e473e21c6a3f9deacc9cf62cc7","target":"graph","created_at":"2026-05-18T00:39:29Z","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":"It is a classical result that an unrooted tree $T$ having positive real-valued edge lengths and no vertices of degree two can be reconstructed from the induced distance between each pair of leaves. Moreover, if each non-leaf vertex of $T$ has degree 3 then the number of distance values required is linear in the number of leaves. A canonical candidate for such a set of pairs of leaves in $T$ is the following: for each non-leaf vertex $v$, choose a leaf in each of the three components of $T-v$, group these three leaves into three pairs, and take the union of this set over all choices of $v$. Thi","authors_text":"Katharina T. Huber, Mike Steel, Stefan Gruenewald, Vincent Moulton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-25T10:44:48Z","title":"Combinatorial properties of triplet covers for binary trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07908","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:033e573bd31237051deecdb17b768a17d38a239b0540951a280384756448b502","target":"record","created_at":"2026-05-18T00:39:29Z","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":"b82eeab06ec8ce47976ce540ce863763f2766b7588d1f7204cdd0726651507cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-25T10:44:48Z","title_canon_sha256":"d0b037a81bb85ed8242005d6fd019ead03b00c61bde2d3aaa4297d1fd5cf1b00"},"schema_version":"1.0","source":{"id":"1707.07908","kind":"arxiv","version":1}},"canonical_sha256":"050d7a8828abe20ac9c7c2fd298353198939b64a1e5c7adcd3a55890da867290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"050d7a8828abe20ac9c7c2fd298353198939b64a1e5c7adcd3a55890da867290","first_computed_at":"2026-05-18T00:39:29.930297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:29.930297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/+nFOr2P5vP5Ozs1bkBRXHNTiUKTrG3ULZuK/sP83Soilqir5152DIcDtZ/MYJXz1v/4/82OORJMZbbNiSt6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:29.930925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:033e573bd31237051deecdb17b768a17d38a239b0540951a280384756448b502","sha256:7224eb23782b577c0e287a495a1b262bd52252e473e21c6a3f9deacc9cf62cc7"],"state_sha256":"f3947e350480dc6ed044b5769c37bbc0ff3419a980096fb97f6ea6e3701549d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quAhNssjAxn2XKV9TSEaSqueT6hor4ykSx9/S9etoQM+nAeuMYm61CEdnRnqxhU73klEk6Sj9OhAJvv4AJ51Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:22:27.859950Z","bundle_sha256":"bb8829a2d39ab04a1898a51353f51ea153d97c5b8f0e7ad9f32d78fd641ce970"}}