{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OXH34BJCGRLE73U6TED3NHR2EE","short_pith_number":"pith:OXH34BJC","canonical_record":{"source":{"id":"1103.0106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-01T08:42:24Z","cross_cats_sorted":[],"title_canon_sha256":"8f7f1fec1341c6f57952ed66e3f2636c70926f87cf1c30f13df5165664707768","abstract_canon_sha256":"272a83ee287b2ab67364c263532f806e394e848dc06c683a14236bf10f4c6d57"},"schema_version":"1.0"},"canonical_sha256":"75cfbe052234564fee9e9907b69e3a2116cbae0832a2fa20214b3623d5e7cd95","source":{"kind":"arxiv","id":"1103.0106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0106","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0106v1","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0106","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"OXH34BJCGRLE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OXH34BJCGRLE73U6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OXH34BJC","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OXH34BJCGRLE73U6TED3NHR2EE","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-01T08:42:24Z","cross_cats_sorted":[],"title_canon_sha256":"8f7f1fec1341c6f57952ed66e3f2636c70926f87cf1c30f13df5165664707768","abstract_canon_sha256":"272a83ee287b2ab67364c263532f806e394e848dc06c683a14236bf10f4c6d57"},"schema_version":"1.0"},"canonical_sha256":"75cfbe052234564fee9e9907b69e3a2116cbae0832a2fa20214b3623d5e7cd95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:30.990183Z","signature_b64":"n9NBTB3NZ6gXm77TGfQNVexDMyUm4is9Kt9IPeQndcSUxMwEFIdGZ77aHNfoUm+uMrp+RA0xGaRk0C5N2Qi/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75cfbe052234564fee9e9907b69e3a2116cbae0832a2fa20214b3623d5e7cd95","last_reissued_at":"2026-05-18T02:22:30.989665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:30.989665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0106","source_version":1,"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-05-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEeexob3YNHPAeEFZ8Ey8AxY4ThEcE6CI1aLoV9QiPdTkj1uyIM+KnTYP4TmJprhZC0akOd1YYAj9xbIA/IDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:24:22.172420Z"},"content_sha256":"e12e1f34c3faa59e461861f8ebfc58d189abfe0c0368cf38874f69edef7131b3","schema_version":"1.0","event_id":"sha256:e12e1f34c3faa59e461861f8ebfc58d189abfe0c0368cf38874f69edef7131b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OXH34BJCGRLE73U6TED3NHR2EE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hypergraph Partitioning through Vertex Separators on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Pinar, Cevdet Aykanat, Enver Kayaaslan, Umit V. Catalyurek","submitted_at":"2011-03-01T08:42:24Z","abstract_excerpt":"The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inherently more complicated than those on graphs, which sometimes translate to nontrivial increases in processing times. Neither the modeling flexibility of hypergraphs, nor the runtime efficiency of graph algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0106","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":""},"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-05-18T02:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNzq3nwyc13Q4Z7Z+A9Pg+S7sazfSabrdv7eFM/xCWf1MVHGHvp0svdGMY4FOfu5bsgxiKyy418VCU0TggWCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:24:22.172845Z"},"content_sha256":"8697f406307c758731b8633fe37110d83ea6e069b27a17d1f642729b7e9a4f90","schema_version":"1.0","event_id":"sha256:8697f406307c758731b8633fe37110d83ea6e069b27a17d1f642729b7e9a4f90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXH34BJCGRLE73U6TED3NHR2EE/bundle.json","state_url":"https://pith.science/pith/OXH34BJCGRLE73U6TED3NHR2EE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXH34BJCGRLE73U6TED3NHR2EE/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-06-05T21:24:22Z","links":{"resolver":"https://pith.science/pith/OXH34BJCGRLE73U6TED3NHR2EE","bundle":"https://pith.science/pith/OXH34BJCGRLE73U6TED3NHR2EE/bundle.json","state":"https://pith.science/pith/OXH34BJCGRLE73U6TED3NHR2EE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXH34BJCGRLE73U6TED3NHR2EE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OXH34BJCGRLE73U6TED3NHR2EE","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":"272a83ee287b2ab67364c263532f806e394e848dc06c683a14236bf10f4c6d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-01T08:42:24Z","title_canon_sha256":"8f7f1fec1341c6f57952ed66e3f2636c70926f87cf1c30f13df5165664707768"},"schema_version":"1.0","source":{"id":"1103.0106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0106","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0106v1","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0106","created_at":"2026-05-18T02:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"OXH34BJCGRLE","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OXH34BJCGRLE73U6","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OXH34BJC","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:8697f406307c758731b8633fe37110d83ea6e069b27a17d1f642729b7e9a4f90","target":"graph","created_at":"2026-05-18T02:22:30Z","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"},"paper":{"abstract_excerpt":"The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inherently more complicated than those on graphs, which sometimes translate to nontrivial increases in processing times. Neither the modeling flexibility of hypergraphs, nor the runtime efficiency of graph algo","authors_text":"Ali Pinar, Cevdet Aykanat, Enver Kayaaslan, Umit V. Catalyurek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-01T08:42:24Z","title":"Hypergraph Partitioning through Vertex Separators on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0106","kind":"arxiv","version":1},"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:e12e1f34c3faa59e461861f8ebfc58d189abfe0c0368cf38874f69edef7131b3","target":"record","created_at":"2026-05-18T02:22:30Z","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":"272a83ee287b2ab67364c263532f806e394e848dc06c683a14236bf10f4c6d57","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-01T08:42:24Z","title_canon_sha256":"8f7f1fec1341c6f57952ed66e3f2636c70926f87cf1c30f13df5165664707768"},"schema_version":"1.0","source":{"id":"1103.0106","kind":"arxiv","version":1}},"canonical_sha256":"75cfbe052234564fee9e9907b69e3a2116cbae0832a2fa20214b3623d5e7cd95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75cfbe052234564fee9e9907b69e3a2116cbae0832a2fa20214b3623d5e7cd95","first_computed_at":"2026-05-18T02:22:30.989665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:30.989665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9NBTB3NZ6gXm77TGfQNVexDMyUm4is9Kt9IPeQndcSUxMwEFIdGZ77aHNfoUm+uMrp+RA0xGaRk0C5N2Qi/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:30.990183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e12e1f34c3faa59e461861f8ebfc58d189abfe0c0368cf38874f69edef7131b3","sha256:8697f406307c758731b8633fe37110d83ea6e069b27a17d1f642729b7e9a4f90"],"state_sha256":"bc7d690372dbe0bf10d24643f432f3e797baf31e0e1dbee2e1fe2c55d2f1fc37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wmPbHwgvhUIR1LSwFAErto5EuzTmoqJSYNzM8FAyINoRpLO5jZmeIAJwjwVaibtp4qCI85R0JBEhmd2RIaJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:24:22.176422Z","bundle_sha256":"c9d77588c62095a269b2365e191fcf1e00a7dff73c6334b5b3ddf6f693b1842b"}}