{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IVROYV5HDI5JHPNQAH3EW7B7V2","short_pith_number":"pith:IVROYV5H","canonical_record":{"source":{"id":"1606.01660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T08:50:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c50ee8969e8ac17c962e8cdc293c63dba70ebded9664211e29fffaab8c0f1975","abstract_canon_sha256":"56fbc7637c7fd3b3d98079889b6e093a512243dc15ff2dc73970f48cd4275d04"},"schema_version":"1.0"},"canonical_sha256":"4562ec57a71a3a93bdb001f64b7c3fae8f5fdf951e0b37d9c36606139a4871ef","source":{"kind":"arxiv","id":"1606.01660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01660","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01660v1","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01660","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"IVROYV5HDI5J","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVROYV5HDI5JHPNQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVROYV5H","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IVROYV5HDI5JHPNQAH3EW7B7V2","target":"record","payload":{"canonical_record":{"source":{"id":"1606.01660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T08:50:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c50ee8969e8ac17c962e8cdc293c63dba70ebded9664211e29fffaab8c0f1975","abstract_canon_sha256":"56fbc7637c7fd3b3d98079889b6e093a512243dc15ff2dc73970f48cd4275d04"},"schema_version":"1.0"},"canonical_sha256":"4562ec57a71a3a93bdb001f64b7c3fae8f5fdf951e0b37d9c36606139a4871ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:53.831855Z","signature_b64":"vra+adsfm71S3qQOrM1Mej91zJtoGgK9CoyfveggnYanhcjR+ijVOOLhS279g9m9KNayARzTH1uCult9+j3VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4562ec57a71a3a93bdb001f64b7c3fae8f5fdf951e0b37d9c36606139a4871ef","last_reissued_at":"2026-05-18T01:12:53.831491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:53.831491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.01660","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-18T01:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eCjZrU1ejXokslVoPNJBs/JgiZIglZrEFxcWxtbV8Eb98EezwK6q9uW6yPuGs/QuNj4b6hR8yebROy597gZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:30:26.064183Z"},"content_sha256":"75d6b8fa6a3586f5059742c3f4911172d97ef7bf138a2cb4def77c913b1d79fb","schema_version":"1.0","event_id":"sha256:75d6b8fa6a3586f5059742c3f4911172d97ef7bf138a2cb4def77c913b1d79fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IVROYV5HDI5JHPNQAH3EW7B7V2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cutsize Distributions of Balanced Hypergraph Bipartitions for Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Takayuki Nozaki","submitted_at":"2016-06-06T08:50:30Z","abstract_excerpt":"In a previous work, we presented a parallel encoding algorithm for low-density parity-check (LDPC) codes by partitioning hypergraph representation for the LDPC codes. The aim of this research is to analyze the processing time of this encoding algorithm. This paper clarifies that the processing time of the encoding algorithm depends on the minimum cutsize of balanced hypergraph partitions. Moreover, this paper gives the typical minimum cutsize and cutsize distribution for balanced hypergraph bipartitions of random hypergraphs defined from a regular LDPC ensemble."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01660","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-18T01:12:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lX9R8AtSWRooOK9FR48xQ+6eZqyePeguZIljKyhvTzAkPiiIcoGv75dtZfEBsTi54mJgWF70ivZYjID20uBACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:30:26.064542Z"},"content_sha256":"1f3e1e83c15724e9262152354c70037bb5995ce0913d2f49f82c0c0fe99dde3c","schema_version":"1.0","event_id":"sha256:1f3e1e83c15724e9262152354c70037bb5995ce0913d2f49f82c0c0fe99dde3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/bundle.json","state_url":"https://pith.science/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/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-01T17:30:26Z","links":{"resolver":"https://pith.science/pith/IVROYV5HDI5JHPNQAH3EW7B7V2","bundle":"https://pith.science/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/bundle.json","state":"https://pith.science/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVROYV5HDI5JHPNQAH3EW7B7V2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IVROYV5HDI5JHPNQAH3EW7B7V2","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":"56fbc7637c7fd3b3d98079889b6e093a512243dc15ff2dc73970f48cd4275d04","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T08:50:30Z","title_canon_sha256":"c50ee8969e8ac17c962e8cdc293c63dba70ebded9664211e29fffaab8c0f1975"},"schema_version":"1.0","source":{"id":"1606.01660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01660","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01660v1","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01660","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"IVROYV5HDI5J","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IVROYV5HDI5JHPNQ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IVROYV5H","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:1f3e1e83c15724e9262152354c70037bb5995ce0913d2f49f82c0c0fe99dde3c","target":"graph","created_at":"2026-05-18T01:12:53Z","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":"In a previous work, we presented a parallel encoding algorithm for low-density parity-check (LDPC) codes by partitioning hypergraph representation for the LDPC codes. The aim of this research is to analyze the processing time of this encoding algorithm. This paper clarifies that the processing time of the encoding algorithm depends on the minimum cutsize of balanced hypergraph partitions. Moreover, this paper gives the typical minimum cutsize and cutsize distribution for balanced hypergraph bipartitions of random hypergraphs defined from a regular LDPC ensemble.","authors_text":"Takayuki Nozaki","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T08:50:30Z","title":"Cutsize Distributions of Balanced Hypergraph Bipartitions for Random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01660","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:75d6b8fa6a3586f5059742c3f4911172d97ef7bf138a2cb4def77c913b1d79fb","target":"record","created_at":"2026-05-18T01:12:53Z","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":"56fbc7637c7fd3b3d98079889b6e093a512243dc15ff2dc73970f48cd4275d04","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-06T08:50:30Z","title_canon_sha256":"c50ee8969e8ac17c962e8cdc293c63dba70ebded9664211e29fffaab8c0f1975"},"schema_version":"1.0","source":{"id":"1606.01660","kind":"arxiv","version":1}},"canonical_sha256":"4562ec57a71a3a93bdb001f64b7c3fae8f5fdf951e0b37d9c36606139a4871ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4562ec57a71a3a93bdb001f64b7c3fae8f5fdf951e0b37d9c36606139a4871ef","first_computed_at":"2026-05-18T01:12:53.831491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:53.831491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vra+adsfm71S3qQOrM1Mej91zJtoGgK9CoyfveggnYanhcjR+ijVOOLhS279g9m9KNayARzTH1uCult9+j3VCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:53.831855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d6b8fa6a3586f5059742c3f4911172d97ef7bf138a2cb4def77c913b1d79fb","sha256:1f3e1e83c15724e9262152354c70037bb5995ce0913d2f49f82c0c0fe99dde3c"],"state_sha256":"0412e74df8a90c243e730d71be365cf7a203775c601549a76bfc8e1fb82b3c20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLKwH6H4Lns2GJFSBmMlv2scDaIZs+FPQJ07yTmI1Z/rQyldynTtBrMqdwK38SlMyxRZB9j/Y3OpmFZEN4b0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:30:26.066476Z","bundle_sha256":"94ea3be6a4213f6d09eefec63b5095ef1f0a56b550fe8e3cfb4561c09333ce81"}}