{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UAFULS7BYEPREUJH4JFZOKUFLJ","short_pith_number":"pith:UAFULS7B","schema_version":"1.0","canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","source":{"kind":"arxiv","id":"1909.04016","version":5},"attestation_state":"computed","paper":{"title":"Hypergraph Partitioning With Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ilya Safro, Justin Sybrandt, Ruslan Shaydulin","submitted_at":"2019-09-09T17:55:23Z","abstract_excerpt":"Problems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems. A hypergraph is a generalization of a traditional graph wherein \"hyperedges\" may connect any number of nodes. As a result, hypergraph partitioning is an NP-Hard problem to both solve or approximate. State-of-the-art algorithms that solve this problem follow the multilevel paradigm, which begins by iteratively \"coarsening\" the input hypergraph to smaller problem instances that share key structural features. Once identifying an approximate proble"},"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":"1909.04016","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-09T17:55:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"365a0fad0f9da6bb9303a4410cc9d5a30d5f8879f47a0572546c1faecd264150","abstract_canon_sha256":"4c36836bff74325bfcca4594d7b0b14fc86d0b8166024b3ab9f4bd29e5dffddb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:55.138034Z","signature_b64":"FAfvToYyTVfZ/YnBLWXs3XsPBdWQGvmfV6O9pZ/4nejOboQHDRvylspZJHA8n9PK7Ey9ew5ay+y6qQ2LddS5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","last_reissued_at":"2026-07-05T04:31:55.137552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:55.137552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Partitioning With Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ilya Safro, Justin Sybrandt, Ruslan Shaydulin","submitted_at":"2019-09-09T17:55:23Z","abstract_excerpt":"Problems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems. A hypergraph is a generalization of a traditional graph wherein \"hyperedges\" may connect any number of nodes. As a result, hypergraph partitioning is an NP-Hard problem to both solve or approximate. State-of-the-art algorithms that solve this problem follow the multilevel paradigm, which begins by iteratively \"coarsening\" the input hypergraph to smaller problem instances that share key structural features. Once identifying an approximate proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04016","kind":"arxiv","version":5},"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/1909.04016/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":"1909.04016","created_at":"2026-07-05T04:31:55.137606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04016v5","created_at":"2026-07-05T04:31:55.137606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04016","created_at":"2026-07-05T04:31:55.137606+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAFULS7BYEPR","created_at":"2026-07-05T04:31:55.137606+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAFULS7BYEPREUJH","created_at":"2026-07-05T04:31:55.137606+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAFULS7B","created_at":"2026-07-05T04:31:55.137606+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/UAFULS7BYEPREUJH4JFZOKUFLJ","json":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ.json","graph_json":"https://pith.science/api/pith-number/UAFULS7BYEPREUJH4JFZOKUFLJ/graph.json","events_json":"https://pith.science/api/pith-number/UAFULS7BYEPREUJH4JFZOKUFLJ/events.json","paper":"https://pith.science/paper/UAFULS7B"},"agent_actions":{"view_html":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ","download_json":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ.json","view_paper":"https://pith.science/paper/UAFULS7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04016&json=true","fetch_graph":"https://pith.science/api/pith-number/UAFULS7BYEPREUJH4JFZOKUFLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UAFULS7BYEPREUJH4JFZOKUFLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/action/storage_attestation","attest_author":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/action/author_attestation","sign_citation":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/action/citation_signature","submit_replication":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/action/replication_record"}},"created_at":"2026-07-05T04:31:55.137606+00:00","updated_at":"2026-07-05T04:31:55.137606+00:00"}