{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SGNWBU6WQQBEKYRDTDNUS2KNUX","short_pith_number":"pith:SGNWBU6W","canonical_record":{"source":{"id":"1802.09610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T21:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"aa11e3e5bf21a7d9988a6581216beb4d5a02fdb3187dcb6930a271ab88b68da5","abstract_canon_sha256":"7701730148a1412e4f8eb7bf9c09998a2d8e615489b6f0daeee9c7d59816450a"},"schema_version":"1.0"},"canonical_sha256":"919b60d3d6840245622398db49694da5cc4efb12f10a511918e97cbe4736b0fa","source":{"kind":"arxiv","id":"1802.09610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09610","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09610v2","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09610","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"SGNWBU6WQQBE","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_16","alias_value":"SGNWBU6WQQBEKYRD","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_8","alias_value":"SGNWBU6W","created_at":"2026-07-05T04:31:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SGNWBU6WQQBEKYRDTDNUS2KNUX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T21:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"aa11e3e5bf21a7d9988a6581216beb4d5a02fdb3187dcb6930a271ab88b68da5","abstract_canon_sha256":"7701730148a1412e4f8eb7bf9c09998a2d8e615489b6f0daeee9c7d59816450a"},"schema_version":"1.0"},"canonical_sha256":"919b60d3d6840245622398db49694da5cc4efb12f10a511918e97cbe4736b0fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:54.689083Z","signature_b64":"xEXdUdTx3kg188f0pq6wvE5L3JX5uoRLZ3ZdAg6cTanNOBVqaeLo87I778LomfzYPAfAXOtN1JKPcyt268rnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919b60d3d6840245622398db49694da5cc4efb12f10a511918e97cbe4736b0fa","last_reissued_at":"2026-07-05T04:31:54.688679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:54.688679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09610","source_version":2,"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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JuO8utIsUPevkfh3yBgERfAApbGimSnNQFkPhiDK6jwgsrIW65U7S075RboL+I6++6ef6zKXgMHBvfNgS+1FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:14:04.238852Z"},"content_sha256":"851ca8dadaf9c14e9637557bd6a921c98221dd9d784f6f58232e2bc0befe0eaa","schema_version":"1.0","event_id":"sha256:851ca8dadaf9c14e9637557bd6a921c98221dd9d784f6f58232e2bc0befe0eaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SGNWBU6WQQBEKYRDTDNUS2KNUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Aggregative Coarsening for Multilevel Hypergraph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ilya Safro, Ruslan Shaydulin","submitted_at":"2018-02-26T21:16:01Z","abstract_excerpt":"Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matching approaches. We demonstrate the effectiveness of the developed schemes as a part of multilevel hypergraph partitioning framework on a wide range of problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09610","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1802.09610/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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZkPBQGTuxIjmzz4OEaHaOJzRgTR65krZ5RcD09AlaSPDBp3SX6tKNwfQsqASldBstGstjLJCjOg+alv6GGljDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T14:14:04.239264Z"},"content_sha256":"878f6c15be4672120adb44c7a1d060c21f5d43d9e6c0268eb7cd3bcb375edcb1","schema_version":"1.0","event_id":"sha256:878f6c15be4672120adb44c7a1d060c21f5d43d9e6c0268eb7cd3bcb375edcb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/bundle.json","state_url":"https://pith.science/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/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-17T14:14:04Z","links":{"resolver":"https://pith.science/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX","bundle":"https://pith.science/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/bundle.json","state":"https://pith.science/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGNWBU6WQQBEKYRDTDNUS2KNUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SGNWBU6WQQBEKYRDTDNUS2KNUX","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":"7701730148a1412e4f8eb7bf9c09998a2d8e615489b6f0daeee9c7d59816450a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T21:16:01Z","title_canon_sha256":"aa11e3e5bf21a7d9988a6581216beb4d5a02fdb3187dcb6930a271ab88b68da5"},"schema_version":"1.0","source":{"id":"1802.09610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09610","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09610v2","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09610","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"SGNWBU6WQQBE","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_16","alias_value":"SGNWBU6WQQBEKYRD","created_at":"2026-07-05T04:31:54Z"},{"alias_kind":"pith_short_8","alias_value":"SGNWBU6W","created_at":"2026-07-05T04:31:54Z"}],"graph_snapshots":[{"event_id":"sha256:878f6c15be4672120adb44c7a1d060c21f5d43d9e6c0268eb7cd3bcb375edcb1","target":"graph","created_at":"2026-07-05T04:31:54Z","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/1802.09610/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matching approaches. We demonstrate the effectiveness of the developed schemes as a part of multilevel hypergraph partitioning framework on a wide range of problems.","authors_text":"Ilya Safro, Ruslan Shaydulin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T21:16:01Z","title":"Aggregative Coarsening for Multilevel Hypergraph Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09610","kind":"arxiv","version":2},"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:851ca8dadaf9c14e9637557bd6a921c98221dd9d784f6f58232e2bc0befe0eaa","target":"record","created_at":"2026-07-05T04:31:54Z","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":"7701730148a1412e4f8eb7bf9c09998a2d8e615489b6f0daeee9c7d59816450a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T21:16:01Z","title_canon_sha256":"aa11e3e5bf21a7d9988a6581216beb4d5a02fdb3187dcb6930a271ab88b68da5"},"schema_version":"1.0","source":{"id":"1802.09610","kind":"arxiv","version":2}},"canonical_sha256":"919b60d3d6840245622398db49694da5cc4efb12f10a511918e97cbe4736b0fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"919b60d3d6840245622398db49694da5cc4efb12f10a511918e97cbe4736b0fa","first_computed_at":"2026-07-05T04:31:54.688679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:54.688679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xEXdUdTx3kg188f0pq6wvE5L3JX5uoRLZ3ZdAg6cTanNOBVqaeLo87I778LomfzYPAfAXOtN1JKPcyt268rnBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:54.689083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:851ca8dadaf9c14e9637557bd6a921c98221dd9d784f6f58232e2bc0befe0eaa","sha256:878f6c15be4672120adb44c7a1d060c21f5d43d9e6c0268eb7cd3bcb375edcb1"],"state_sha256":"eefa33f59ac99bf75e33598588ff8166d6cb68a9f6548d2b27a9a530b462a88a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsyEJvGQ+BA8pDCvLZ9c26ZVmhVuAEW7hyMLa+DC1yue6aZyNc9tOc59aY8Ba1u/KGnvhi9tVX6Ypo+f2Y8DDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T14:14:04.242075Z","bundle_sha256":"7086e1664b65b657dc0c7818f972235778cae3ebc6ea8f2182d455c2f14bd24b"}}