{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P3M363RBHMH5EYHGNNSFIQDKH5","short_pith_number":"pith:P3M363RB","schema_version":"1.0","canonical_sha256":"7ed9bf6e213b0fd260e66b6454406a3f7163222f5a7a835668f67c5cb0a0c46a","source":{"kind":"arxiv","id":"1312.5408","version":3},"attestation_state":"computed","paper":{"title":"Diversities and the Geometry of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.MG","authors_text":"David Bryant, Paul F. Tupper","submitted_at":"2013-12-19T05:08:10Z","abstract_excerpt":"The embedding of finite metrics in $\\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between max-flow min-cut theorems and the minimal distortion embeddings of metrics into $\\ell_1$. Here we show that this theory can be generalized considerably to encompass Steiner tree packing problems in both graphs and hypergraphs. Instead of the theory of $\\ell_1$ metrics and minimal distortion embeddings, the parallel is the theory of diversities recently introduce"},"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":"1312.5408","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-12-19T05:08:10Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"eb67e48d4dab0a2cb4b76d89e01d36aa06835494340e6115270c5d661bdbe15a","abstract_canon_sha256":"d374191a354cec19512cafb84caaf85153cbc464174e623efb39dacb0e9a0b4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.970871Z","signature_b64":"yqB1Dvt2B1NS+vxSiMq+5yuP9B+c+VX4C+/EffpdX/Il74hquXVIwlIEw01ZM/3NO9lVpoJ7B3uDcgWOfUvnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed9bf6e213b0fd260e66b6454406a3f7163222f5a7a835668f67c5cb0a0c46a","last_reissued_at":"2026-05-18T02:53:55.970024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.970024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diversities and the Geometry of Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.MG","authors_text":"David Bryant, Paul F. Tupper","submitted_at":"2013-12-19T05:08:10Z","abstract_excerpt":"The embedding of finite metrics in $\\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between max-flow min-cut theorems and the minimal distortion embeddings of metrics into $\\ell_1$. Here we show that this theory can be generalized considerably to encompass Steiner tree packing problems in both graphs and hypergraphs. Instead of the theory of $\\ell_1$ metrics and minimal distortion embeddings, the parallel is the theory of diversities recently introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5408","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":"1312.5408","created_at":"2026-05-18T02:53:55.970172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5408v3","created_at":"2026-05-18T02:53:55.970172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5408","created_at":"2026-05-18T02:53:55.970172+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3M363RBHMH5","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3M363RBHMH5EYHG","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3M363RB","created_at":"2026-05-18T12:27:54.935989+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/P3M363RBHMH5EYHGNNSFIQDKH5","json":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5.json","graph_json":"https://pith.science/api/pith-number/P3M363RBHMH5EYHGNNSFIQDKH5/graph.json","events_json":"https://pith.science/api/pith-number/P3M363RBHMH5EYHGNNSFIQDKH5/events.json","paper":"https://pith.science/paper/P3M363RB"},"agent_actions":{"view_html":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5","download_json":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5.json","view_paper":"https://pith.science/paper/P3M363RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5408&json=true","fetch_graph":"https://pith.science/api/pith-number/P3M363RBHMH5EYHGNNSFIQDKH5/graph.json","fetch_events":"https://pith.science/api/pith-number/P3M363RBHMH5EYHGNNSFIQDKH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5/action/storage_attestation","attest_author":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5/action/author_attestation","sign_citation":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5/action/citation_signature","submit_replication":"https://pith.science/pith/P3M363RBHMH5EYHGNNSFIQDKH5/action/replication_record"}},"created_at":"2026-05-18T02:53:55.970172+00:00","updated_at":"2026-05-18T02:53:55.970172+00:00"}