{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UQEYWC6YGPQH3YZOCS6BPDHXTO","short_pith_number":"pith:UQEYWC6Y","canonical_record":{"source":{"id":"1701.07521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T23:57:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"75868c5adf3414b169c68d9d029ac58c47ac6a36a640cac1afa8d36f57252727","abstract_canon_sha256":"19ab19ae213c51759c949f23bdefc60ed39899655cd8b2c4c43d56f504e1bb13"},"schema_version":"1.0"},"canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","source":{"kind":"arxiv","id":"1701.07521","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07521","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07521v2","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07521","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"UQEYWC6YGPQH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQEYWC6YGPQH3YZO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQEYWC6Y","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UQEYWC6YGPQH3YZOCS6BPDHXTO","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07521","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T23:57:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"75868c5adf3414b169c68d9d029ac58c47ac6a36a640cac1afa8d36f57252727","abstract_canon_sha256":"19ab19ae213c51759c949f23bdefc60ed39899655cd8b2c4c43d56f504e1bb13"},"schema_version":"1.0"},"canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.630836Z","signature_b64":"Iezv6BGHxeRe06HyrTeTveryQC6qBOkbpRdb2CiwNZD/cRmLayyhi4UzWXM2PyAVgvjBgte3iKmetR56ljgHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","last_reissued_at":"2026-05-18T00:51:24.630144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.630144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07521","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-05-18T00:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vixe/NaaJX8afn/kNzU5WGgs5Ft+grwAT8s4ANhPFpcfrj1aep3XeGXil0d8cjOkz/+iTRPANanUAt/PAL9BCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:10:13.367405Z"},"content_sha256":"aa5fa55472f684474edbd5a44eaa46204ce09f4da7d15b9306ef0a5de4f76eff","schema_version":"1.0","event_id":"sha256:aa5fa55472f684474edbd5a44eaa46204ce09f4da7d15b9306ef0a5de4f76eff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UQEYWC6YGPQH3YZOCS6BPDHXTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Floor Scale Modulo Lifting for QC-LDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ilya Vorobyev, Nikita Polyanskii, Vasiliy Usatyuk","submitted_at":"2017-01-25T23:57:17Z","abstract_excerpt":"In the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making some offline calculation of scale parameter it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix using only floor and scale operations. The only parameter we store in memo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07521","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":""},"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-18T00:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8T+8DApotqTWyEdWAwCDgnEpc7jBnYKJai3it6JkMMvTlHB9oaKaXy1DVOIPLLth2L35xnFg2/1BoNCQIwcxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:10:13.367769Z"},"content_sha256":"367e0df0be24163e5186ff82cbbcdce3727fcfc37813bb7a4c21ede6b511c5e1","schema_version":"1.0","event_id":"sha256:367e0df0be24163e5186ff82cbbcdce3727fcfc37813bb7a4c21ede6b511c5e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/bundle.json","state_url":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/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-24T19:10:13Z","links":{"resolver":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO","bundle":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/bundle.json","state":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UQEYWC6YGPQH3YZOCS6BPDHXTO","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":"19ab19ae213c51759c949f23bdefc60ed39899655cd8b2c4c43d56f504e1bb13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T23:57:17Z","title_canon_sha256":"75868c5adf3414b169c68d9d029ac58c47ac6a36a640cac1afa8d36f57252727"},"schema_version":"1.0","source":{"id":"1701.07521","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07521","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07521v2","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07521","created_at":"2026-05-18T00:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"UQEYWC6YGPQH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UQEYWC6YGPQH3YZO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UQEYWC6Y","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:367e0df0be24163e5186ff82cbbcdce3727fcfc37813bb7a4c21ede6b511c5e1","target":"graph","created_at":"2026-05-18T00:51:24Z","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 the given paper we present a novel approach for constructing a QC-LDPC code of smaller length by lifting a given QC-LDPC code. The proposed method can be considered as a generalization of floor lifting. Also we prove several probabilistic statements concerning a theoretical improvement of the method with respect to the number of small cycles. Making some offline calculation of scale parameter it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated from a single exponent matrix using only floor and scale operations. The only parameter we store in memo","authors_text":"Ilya Vorobyev, Nikita Polyanskii, Vasiliy Usatyuk","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T23:57:17Z","title":"Floor Scale Modulo Lifting for QC-LDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07521","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:aa5fa55472f684474edbd5a44eaa46204ce09f4da7d15b9306ef0a5de4f76eff","target":"record","created_at":"2026-05-18T00:51:24Z","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":"19ab19ae213c51759c949f23bdefc60ed39899655cd8b2c4c43d56f504e1bb13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-25T23:57:17Z","title_canon_sha256":"75868c5adf3414b169c68d9d029ac58c47ac6a36a640cac1afa8d36f57252727"},"schema_version":"1.0","source":{"id":"1701.07521","kind":"arxiv","version":2}},"canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","first_computed_at":"2026-05-18T00:51:24.630144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:24.630144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iezv6BGHxeRe06HyrTeTveryQC6qBOkbpRdb2CiwNZD/cRmLayyhi4UzWXM2PyAVgvjBgte3iKmetR56ljgHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:24.630836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07521","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa5fa55472f684474edbd5a44eaa46204ce09f4da7d15b9306ef0a5de4f76eff","sha256:367e0df0be24163e5186ff82cbbcdce3727fcfc37813bb7a4c21ede6b511c5e1"],"state_sha256":"4a790ee1360ee81d2774f819bbcad7af233ce1b1f79796af8933cb8373618e63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO4juQciXOmrrZleo/fAmia8Xfm4fC1IifmduxRkxgcsHFuWtG4hxsYTx7gmlSxIhDJouauXijXzkIn9wjykCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:10:13.369695Z","bundle_sha256":"ea8774b1328d6964694d04a0c8ee585318320c0fdeb15df710cb3a9d39855f92"}}