{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IZ5JQTT52D4TZJMRFMJUJ6MIF4","short_pith_number":"pith:IZ5JQTT5","schema_version":"1.0","canonical_sha256":"467a984e7dd0f93ca5912b1344f9882f15ae1cc42fda580e4ffd628fb8175b7b","source":{"kind":"arxiv","id":"2606.13491","version":1},"attestation_state":"computed","paper":{"title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javad Maheri, K.K.Krishnan Namboodiri, Petros Elia","submitted_at":"2026-06-11T15:39:55Z","abstract_excerpt":"Hypergraph edge partitioning is a central problem in theoretical and applied computer science, with broad impact on distributed computation, communications, optimization, and machine learning. In this setting, one is given a collection of hyperedges -- each consisting of up to $d$ vertices from a ground set of size $n$ -- and seeks to assign these hyperedges across $N$ partitions so as to minimize, for example, the vertex footprint, i.e., the maximum number of vertices that appear in any partition. We here identify the fundamental limits of hypergraph edge partitioning -- optimized over all co"},"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":"2606.13491","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-06-11T15:39:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24c19bc0777bdb5b102afc843088099782d10eb1e4f4d01a31a2867b4e5ce59a","abstract_canon_sha256":"685f933b1ae7b0d5c3ecce1b8403e9765520c9af287eb4ff4495790aa77b500a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:06.474117Z","signature_b64":"RFYMACMn9pPrqwovseMQsddkdM6XHyQXIJG0r/r43ecJOovpIQNWLXHVcc4MVxD19tPL9ByBlOoqSvmt9BGjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467a984e7dd0f93ca5912b1344f9882f15ae1cc42fda580e4ffd628fb8175b7b","last_reissued_at":"2026-06-12T01:10:06.473278Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:06.473278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Javad Maheri, K.K.Krishnan Namboodiri, Petros Elia","submitted_at":"2026-06-11T15:39:55Z","abstract_excerpt":"Hypergraph edge partitioning is a central problem in theoretical and applied computer science, with broad impact on distributed computation, communications, optimization, and machine learning. In this setting, one is given a collection of hyperedges -- each consisting of up to $d$ vertices from a ground set of size $n$ -- and seeks to assign these hyperedges across $N$ partitions so as to minimize, for example, the vertex footprint, i.e., the maximum number of vertices that appear in any partition. We here identify the fundamental limits of hypergraph edge partitioning -- optimized over all co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13491","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.13491/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.13491","created_at":"2026-06-12T01:10:06.473419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13491v1","created_at":"2026-06-12T01:10:06.473419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13491","created_at":"2026-06-12T01:10:06.473419+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ5JQTT52D4T","created_at":"2026-06-12T01:10:06.473419+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ5JQTT52D4TZJMR","created_at":"2026-06-12T01:10:06.473419+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ5JQTT5","created_at":"2026-06-12T01:10:06.473419+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/IZ5JQTT52D4TZJMRFMJUJ6MIF4","json":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4.json","graph_json":"https://pith.science/api/pith-number/IZ5JQTT52D4TZJMRFMJUJ6MIF4/graph.json","events_json":"https://pith.science/api/pith-number/IZ5JQTT52D4TZJMRFMJUJ6MIF4/events.json","paper":"https://pith.science/paper/IZ5JQTT5"},"agent_actions":{"view_html":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4","download_json":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4.json","view_paper":"https://pith.science/paper/IZ5JQTT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13491&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ5JQTT52D4TZJMRFMJUJ6MIF4/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ5JQTT52D4TZJMRFMJUJ6MIF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4/action/storage_attestation","attest_author":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4/action/author_attestation","sign_citation":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4/action/citation_signature","submit_replication":"https://pith.science/pith/IZ5JQTT52D4TZJMRFMJUJ6MIF4/action/replication_record"}},"created_at":"2026-06-12T01:10:06.473419+00:00","updated_at":"2026-06-12T01:10:06.473419+00:00"}