{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:S236NAEB5FXVG2E45C3ASI3EQW","short_pith_number":"pith:S236NAEB","schema_version":"1.0","canonical_sha256":"96b7e68081e96f53689ce8b6092364858c1e577c35d05df4567ef8525e78837c","source":{"kind":"arxiv","id":"0705.0411","version":2},"attestation_state":"computed","paper":{"title":"Enhanced negative type for finite metric trees","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.FA","authors_text":"Anthony Weston, Ian Doust","submitted_at":"2007-05-03T06:17:03Z","abstract_excerpt":"Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities that quantify the extent of the \"strictness\" of the 1-negative type inequalities for finite metric trees. These inequalities of \"enhanced 1-negative type\" are sufficiently strong to imply that any given finite metric tree must have strict p-negative type for all values of p in an open interval that contains the number 1. Moreover, these open intervals can be characterized purely in terms of the unordered distribution of edge weights that determine the path metric on the particu"},"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":"0705.0411","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.FA","submitted_at":"2007-05-03T06:17:03Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"b872cfa070775e19f2316e8f4c98571ed0a0f10808deef637bef1bd316074052","abstract_canon_sha256":"600e0f45af8955b0979aa13104d1d3964ba52b740d543f7c6779d66c71a00a94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:59.001335Z","signature_b64":"CF23zGoFUetWD10625EEskm+eEw/tS9MhMUvxxk7QoLwgCw1zTc18Q9XdDkRGkdO/ohe9k2dAD49ggj5p1f7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b7e68081e96f53689ce8b6092364858c1e577c35d05df4567ef8525e78837c","last_reissued_at":"2026-05-18T01:33:59.000763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:59.000763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhanced negative type for finite metric trees","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.FA","authors_text":"Anthony Weston, Ian Doust","submitted_at":"2007-05-03T06:17:03Z","abstract_excerpt":"Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities that quantify the extent of the \"strictness\" of the 1-negative type inequalities for finite metric trees. These inequalities of \"enhanced 1-negative type\" are sufficiently strong to imply that any given finite metric tree must have strict p-negative type for all values of p in an open interval that contains the number 1. Moreover, these open intervals can be characterized purely in terms of the unordered distribution of edge weights that determine the path metric on the particu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0411","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":"0705.0411","created_at":"2026-05-18T01:33:59.000840+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.0411v2","created_at":"2026-05-18T01:33:59.000840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0411","created_at":"2026-05-18T01:33:59.000840+00:00"},{"alias_kind":"pith_short_12","alias_value":"S236NAEB5FXV","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"S236NAEB5FXVG2E4","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"S236NAEB","created_at":"2026-05-18T12:25:56.245647+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/S236NAEB5FXVG2E45C3ASI3EQW","json":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW.json","graph_json":"https://pith.science/api/pith-number/S236NAEB5FXVG2E45C3ASI3EQW/graph.json","events_json":"https://pith.science/api/pith-number/S236NAEB5FXVG2E45C3ASI3EQW/events.json","paper":"https://pith.science/paper/S236NAEB"},"agent_actions":{"view_html":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW","download_json":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW.json","view_paper":"https://pith.science/paper/S236NAEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.0411&json=true","fetch_graph":"https://pith.science/api/pith-number/S236NAEB5FXVG2E45C3ASI3EQW/graph.json","fetch_events":"https://pith.science/api/pith-number/S236NAEB5FXVG2E45C3ASI3EQW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW/action/storage_attestation","attest_author":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW/action/author_attestation","sign_citation":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW/action/citation_signature","submit_replication":"https://pith.science/pith/S236NAEB5FXVG2E45C3ASI3EQW/action/replication_record"}},"created_at":"2026-05-18T01:33:59.000840+00:00","updated_at":"2026-05-18T01:33:59.000840+00:00"}