{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:K4YBA4WUU4SJZFRQQCPH5HEDUQ","short_pith_number":"pith:K4YBA4WU","schema_version":"1.0","canonical_sha256":"57301072d4a7249c9630809e7e9c83a420f3c284154e6b65cc00623f30c31825","source":{"kind":"arxiv","id":"0712.3026","version":3},"attestation_state":"computed","paper":{"title":"Sets of double and triple weights of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Elena Rubei","submitted_at":"2007-12-18T19:18:36Z","abstract_excerpt":"Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers \"triple weights\" of the tree. In this paper, we give a characterization, different from the previous ones, for sets indexed by 2-subsets of a $n$-set to be double weights of a tree. By using the same ideas,we find also necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an $n$-set to be the set of the triple weights of a tree with $n$ leaves. Besides we propose a slight modification of Saitou-N"},"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":"0712.3026","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2007-12-18T19:18:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2b5e39b1c8f9b4bd69c39bfec8b89039caec8a778786522c802ca3456f962bfb","abstract_canon_sha256":"8d4db92fc5e61abf4b7996cd663c7ccc9159f30739172e2a46ef42ec48bf2eda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:35.353421Z","signature_b64":"URDkOBMImgzrFmg7DeUR+9TYEtwO5cTen2KS2ilHNeAJU8Ce7qUQ5g9XnIiu7MeO6pProoMSkospW5dz6zEIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57301072d4a7249c9630809e7e9c83a420f3c284154e6b65cc00623f30c31825","last_reissued_at":"2026-05-18T04:23:35.352789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:35.352789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sets of double and triple weights of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Elena Rubei","submitted_at":"2007-12-18T19:18:36Z","abstract_excerpt":"Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers \"triple weights\" of the tree. In this paper, we give a characterization, different from the previous ones, for sets indexed by 2-subsets of a $n$-set to be double weights of a tree. By using the same ideas,we find also necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an $n$-set to be the set of the triple weights of a tree with $n$ leaves. Besides we propose a slight modification of Saitou-N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.3026","kind":"arxiv","version":3},"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":"0712.3026","created_at":"2026-05-18T04:23:35.352872+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.3026v3","created_at":"2026-05-18T04:23:35.352872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.3026","created_at":"2026-05-18T04:23:35.352872+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4YBA4WUU4SJ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4YBA4WUU4SJZFRQ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4YBA4WU","created_at":"2026-05-18T12:25:55.427421+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/K4YBA4WUU4SJZFRQQCPH5HEDUQ","json":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ.json","graph_json":"https://pith.science/api/pith-number/K4YBA4WUU4SJZFRQQCPH5HEDUQ/graph.json","events_json":"https://pith.science/api/pith-number/K4YBA4WUU4SJZFRQQCPH5HEDUQ/events.json","paper":"https://pith.science/paper/K4YBA4WU"},"agent_actions":{"view_html":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ","download_json":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ.json","view_paper":"https://pith.science/paper/K4YBA4WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.3026&json=true","fetch_graph":"https://pith.science/api/pith-number/K4YBA4WUU4SJZFRQQCPH5HEDUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/K4YBA4WUU4SJZFRQQCPH5HEDUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ/action/storage_attestation","attest_author":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ/action/author_attestation","sign_citation":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ/action/citation_signature","submit_replication":"https://pith.science/pith/K4YBA4WUU4SJZFRQQCPH5HEDUQ/action/replication_record"}},"created_at":"2026-05-18T04:23:35.352872+00:00","updated_at":"2026-05-18T04:23:35.352872+00:00"}