{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UQEYWC6YGPQH3YZOCS6BPDHXTO","short_pith_number":"pith:UQEYWC6Y","schema_version":"1.0","canonical_sha256":"a4098b0bd833e07de32e14bc178cf79bad44c5df50c0adc72f0ed544dcbb3038","source":{"kind":"arxiv","id":"1701.07521","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.07521","created_at":"2026-05-18T00:51:24.630233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07521v2","created_at":"2026-05-18T00:51:24.630233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07521","created_at":"2026-05-18T00:51:24.630233+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQEYWC6YGPQH","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQEYWC6YGPQH3YZO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQEYWC6Y","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO","json":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO.json","graph_json":"https://pith.science/api/pith-number/UQEYWC6YGPQH3YZOCS6BPDHXTO/graph.json","events_json":"https://pith.science/api/pith-number/UQEYWC6YGPQH3YZOCS6BPDHXTO/events.json","paper":"https://pith.science/paper/UQEYWC6Y"},"agent_actions":{"view_html":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO","download_json":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO.json","view_paper":"https://pith.science/paper/UQEYWC6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07521&json=true","fetch_graph":"https://pith.science/api/pith-number/UQEYWC6YGPQH3YZOCS6BPDHXTO/graph.json","fetch_events":"https://pith.science/api/pith-number/UQEYWC6YGPQH3YZOCS6BPDHXTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/action/storage_attestation","attest_author":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/action/author_attestation","sign_citation":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/action/citation_signature","submit_replication":"https://pith.science/pith/UQEYWC6YGPQH3YZOCS6BPDHXTO/action/replication_record"}},"created_at":"2026-05-18T00:51:24.630233+00:00","updated_at":"2026-05-18T00:51:24.630233+00:00"}