{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UAFULS7BYEPREUJH4JFZOKUFLJ","short_pith_number":"pith:UAFULS7B","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"},"canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","source":{"kind":"arxiv","id":"1909.04016","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04016","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04016v5","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04016","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"UAFULS7BYEPR","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"UAFULS7BYEPREUJH","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"UAFULS7B","created_at":"2026-07-05T04:31:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UAFULS7BYEPREUJH4JFZOKUFLJ","target":"record","payload":{"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"},"canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","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"},"source_kind":"arxiv","source_id":"1909.04016","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vb+1ABGy3iGDgqEfZrL2nTnHFBVukrJnliDrCRX4ElW3ci1Lls6kEqoeE89BfkL1K92jKSUsOSXFJDWW3vb9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:04.259447Z"},"content_sha256":"59f2641028f5650730cee50383a121b5bed49fbb9e356d0cd3a13ed0da578ee3","schema_version":"1.0","event_id":"sha256:59f2641028f5650730cee50383a121b5bed49fbb9e356d0cd3a13ed0da578ee3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UAFULS7BYEPREUJH4JFZOKUFLJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IcHak5XnpD1/rkv1um2fvsEaPcKJMvvCOWau1jvVEijSiekr/hvCrSMhM92LRTVWRAjAUlTRO/DL3S81q5/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:04.259936Z"},"content_sha256":"58c8ff10b3cccec4bd66ebdca321b67f46e53aa42faab733398b1abb19541992","schema_version":"1.0","event_id":"sha256:58c8ff10b3cccec4bd66ebdca321b67f46e53aa42faab733398b1abb19541992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/bundle.json","state_url":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T15:51:04Z","links":{"resolver":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ","bundle":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/bundle.json","state":"https://pith.science/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAFULS7BYEPREUJH4JFZOKUFLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UAFULS7BYEPREUJH4JFZOKUFLJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4c36836bff74325bfcca4594d7b0b14fc86d0b8166024b3ab9f4bd29e5dffddb","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-09T17:55:23Z","title_canon_sha256":"365a0fad0f9da6bb9303a4410cc9d5a30d5f8879f47a0572546c1faecd264150"},"schema_version":"1.0","source":{"id":"1909.04016","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.04016","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1909.04016v5","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04016","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"UAFULS7BYEPR","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_16","alias_value":"UAFULS7BYEPREUJH","created_at":"2026-07-05T04:31:55Z"},{"alias_kind":"pith_short_8","alias_value":"UAFULS7B","created_at":"2026-07-05T04:31:55Z"}],"graph_snapshots":[{"event_id":"sha256:58c8ff10b3cccec4bd66ebdca321b67f46e53aa42faab733398b1abb19541992","target":"graph","created_at":"2026-07-05T04:31:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.04016/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ilya Safro, Justin Sybrandt, Ruslan Shaydulin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-09T17:55:23Z","title":"Hypergraph Partitioning With Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04016","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59f2641028f5650730cee50383a121b5bed49fbb9e356d0cd3a13ed0da578ee3","target":"record","created_at":"2026-07-05T04:31:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4c36836bff74325bfcca4594d7b0b14fc86d0b8166024b3ab9f4bd29e5dffddb","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-09-09T17:55:23Z","title_canon_sha256":"365a0fad0f9da6bb9303a4410cc9d5a30d5f8879f47a0572546c1faecd264150"},"schema_version":"1.0","source":{"id":"1909.04016","kind":"arxiv","version":5}},"canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a00b45cbe1c11f125127e24b972a855a50a1ec0828a8f25c3cb37c7997521c56","first_computed_at":"2026-07-05T04:31:55.137552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:55.137552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FAfvToYyTVfZ/YnBLWXs3XsPBdWQGvmfV6O9pZ/4nejOboQHDRvylspZJHA8n9PK7Ey9ew5ay+y6qQ2LddS5Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:55.138034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.04016","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59f2641028f5650730cee50383a121b5bed49fbb9e356d0cd3a13ed0da578ee3","sha256:58c8ff10b3cccec4bd66ebdca321b67f46e53aa42faab733398b1abb19541992"],"state_sha256":"32e89f4a67a6d0db005be3158d48b7eb33790dc083c3af304643d69c394bf588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRDRCjrQX0jg60t/dxfaMEyelLzTk5XPBBXFRyTHuGoeVM9XcISlxD8ccd+W6LKxRYguW2+YTi67wQZn+ty3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:51:04.263344Z","bundle_sha256":"c90f849ddf8783497319b6d52950d55d68b0b13078236517084c7ce2dd2fb00a"}}