{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:V5DDINE4VABWNTYT3TUWHNDVAQ","short_pith_number":"pith:V5DDINE4","canonical_record":{"source":{"id":"2401.14810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T12:16:55Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"6d5757a5816cb1f418a934be8c3e8c83a6e8ae39e114df6ef59f35dd0289e97a","abstract_canon_sha256":"fc55859d0415e14dfe186954bedc1b360abdd92ae82eeaec4497e9e1ee8e499e"},"schema_version":"1.0"},"canonical_sha256":"af4634349ca80366cf13dce963b47504260fa444442dd91c583024a383575ea4","source":{"kind":"arxiv","id":"2401.14810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14810","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14810v1","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14810","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"V5DDINE4VABW","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_16","alias_value":"V5DDINE4VABWNTYT","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_8","alias_value":"V5DDINE4","created_at":"2026-07-05T07:38:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:V5DDINE4VABWNTYT3TUWHNDVAQ","target":"record","payload":{"canonical_record":{"source":{"id":"2401.14810","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T12:16:55Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"6d5757a5816cb1f418a934be8c3e8c83a6e8ae39e114df6ef59f35dd0289e97a","abstract_canon_sha256":"fc55859d0415e14dfe186954bedc1b360abdd92ae82eeaec4497e9e1ee8e499e"},"schema_version":"1.0"},"canonical_sha256":"af4634349ca80366cf13dce963b47504260fa444442dd91c583024a383575ea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:02.169125Z","signature_b64":"4Y69Ak39f44BOAH40e5n4vBWU2ZpsBvg0Ds5lZ/myrquwuUzc2Q558lHGZjNFWnDabqivqhNTRFZp7zCKBvRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af4634349ca80366cf13dce963b47504260fa444442dd91c583024a383575ea4","last_reissued_at":"2026-07-05T07:38:02.168638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:02.168638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.14810","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-07-05T07:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0v6GR9wLILLYD8ivGzUMQ4ZL37PQCiccZMU1ul/pnooSfG9Y6RAgcSu3W3QJmgj7xf6DnHDgeoCE9TQ1r1nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T18:11:36.848235Z"},"content_sha256":"40d6c6de6867590d06e02e27c68bb7760f968596dc66f81af76fa86a669b92b5","schema_version":"1.0","event_id":"sha256:40d6c6de6867590d06e02e27c68bb7760f968596dc66f81af76fa86a669b92b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:V5DDINE4VABWNTYT3TUWHNDVAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Sergey Egorov, Vasiliy Usatyuk, Yury Kuznetsov","submitted_at":"2024-01-26T12:16:55Z","abstract_excerpt":"This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline the importance sampling step for estimating the pseudo-codeword weight of Trapping sets. The presented methodology draws on the mathematical framework established in the provided theorem, which elucidates the behavior of projection and lifting transformations on pseudo-codewords"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14810","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.14810/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-05T07:38:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+EX9eRTrmLBwRv3yXb8+NA43Az5MquA1lehJysEBkmxCqLq6CzXpT2+wy/mcADpNPVXGZPDqrHZgp/z7L+EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T18:11:36.848629Z"},"content_sha256":"c204d3e203740ab384887e15be709666f6c4e899f81f082c10e7e2bfc841c5d1","schema_version":"1.0","event_id":"sha256:c204d3e203740ab384887e15be709666f6c4e899f81f082c10e7e2bfc841c5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/bundle.json","state_url":"https://pith.science/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/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-07-11T18:11:36Z","links":{"resolver":"https://pith.science/pith/V5DDINE4VABWNTYT3TUWHNDVAQ","bundle":"https://pith.science/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/bundle.json","state":"https://pith.science/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5DDINE4VABWNTYT3TUWHNDVAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V5DDINE4VABWNTYT3TUWHNDVAQ","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":"fc55859d0415e14dfe186954bedc1b360abdd92ae82eeaec4497e9e1ee8e499e","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T12:16:55Z","title_canon_sha256":"6d5757a5816cb1f418a934be8c3e8c83a6e8ae39e114df6ef59f35dd0289e97a"},"schema_version":"1.0","source":{"id":"2401.14810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14810","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14810v1","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14810","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_12","alias_value":"V5DDINE4VABW","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_16","alias_value":"V5DDINE4VABWNTYT","created_at":"2026-07-05T07:38:02Z"},{"alias_kind":"pith_short_8","alias_value":"V5DDINE4","created_at":"2026-07-05T07:38:02Z"}],"graph_snapshots":[{"event_id":"sha256:c204d3e203740ab384887e15be709666f6c4e899f81f082c10e7e2bfc841c5d1","target":"graph","created_at":"2026-07-05T07:38:02Z","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/2401.14810/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a novel approach to enumerate and assess Trapping sets in quasi-cyclic codes, those with circulant sizes that are non-prime numbers. Leveraging the quasi-cyclic properties, the method employs a tabular technique to streamline the importance sampling step for estimating the pseudo-codeword weight of Trapping sets. The presented methodology draws on the mathematical framework established in the provided theorem, which elucidates the behavior of projection and lifting transformations on pseudo-codewords","authors_text":"Sergey Egorov, Vasiliy Usatyuk, Yury Kuznetsov","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T12:16:55Z","title":"Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14810","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:40d6c6de6867590d06e02e27c68bb7760f968596dc66f81af76fa86a669b92b5","target":"record","created_at":"2026-07-05T07:38:02Z","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":"fc55859d0415e14dfe186954bedc1b360abdd92ae82eeaec4497e9e1ee8e499e","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-26T12:16:55Z","title_canon_sha256":"6d5757a5816cb1f418a934be8c3e8c83a6e8ae39e114df6ef59f35dd0289e97a"},"schema_version":"1.0","source":{"id":"2401.14810","kind":"arxiv","version":1}},"canonical_sha256":"af4634349ca80366cf13dce963b47504260fa444442dd91c583024a383575ea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af4634349ca80366cf13dce963b47504260fa444442dd91c583024a383575ea4","first_computed_at":"2026-07-05T07:38:02.168638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:02.168638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Y69Ak39f44BOAH40e5n4vBWU2ZpsBvg0Ds5lZ/myrquwuUzc2Q558lHGZjNFWnDabqivqhNTRFZp7zCKBvRAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:02.169125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.14810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40d6c6de6867590d06e02e27c68bb7760f968596dc66f81af76fa86a669b92b5","sha256:c204d3e203740ab384887e15be709666f6c4e899f81f082c10e7e2bfc841c5d1"],"state_sha256":"dd348452a1b002f46664aca3944de2cd5810cb45af12d834144bb6866532a82f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBSspRusLToFfGFy00vSuw/OH6EAvbFicUrK6A/gJ6sBf9SCZp/HRRv6SxX0jVeNuwwOUYrc4O6EP5Kt5W8qDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T18:11:36.850828Z","bundle_sha256":"2a03129adb8f1a15211306738b2cd583903c9098c92e13ab3c7505cf2e9f6953"}}