{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IV3GGVFH4J23UCYI7KDD3TN666","short_pith_number":"pith:IV3GGVFH","canonical_record":{"source":{"id":"2301.09783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:59:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"81630f1e37752eecfd7d4d32ea09321362bb2a0133dcb19c78b59fb27e4e1026","abstract_canon_sha256":"24e77e506c0ad623bc5b54beb18f6746d7bc78afa9d2b8f48e351b4e9a68c069"},"schema_version":"1.0"},"canonical_sha256":"45766354a7e275ba0b08fa863dcdbef79a59704dc01867982e5d0b6ab746f831","source":{"kind":"arxiv","id":"2301.09783","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.09783","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.09783v2","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09783","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"IV3GGVFH4J23","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_16","alias_value":"IV3GGVFH4J23UCYI","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_8","alias_value":"IV3GGVFH","created_at":"2026-07-05T05:35:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IV3GGVFH4J23UCYI7KDD3TN666","target":"record","payload":{"canonical_record":{"source":{"id":"2301.09783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:59:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"81630f1e37752eecfd7d4d32ea09321362bb2a0133dcb19c78b59fb27e4e1026","abstract_canon_sha256":"24e77e506c0ad623bc5b54beb18f6746d7bc78afa9d2b8f48e351b4e9a68c069"},"schema_version":"1.0"},"canonical_sha256":"45766354a7e275ba0b08fa863dcdbef79a59704dc01867982e5d0b6ab746f831","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:48.852861Z","signature_b64":"QL6VekjLsUS8NafWtshTkvZPI530A8H7wsS2impE5PFsLnKpqvKxTegISc5mCP+hWzqUQxEY26h01KoEg0tdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45766354a7e275ba0b08fa863dcdbef79a59704dc01867982e5d0b6ab746f831","last_reissued_at":"2026-07-05T05:35:48.852305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:48.852305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.09783","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-07-05T05:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OV2QcZcb31rKpw+s/SuJxdEnHtGlJ8rmGny42YiNDRqa5QabsfpYBlmmoaB785k28lWJ4ail5QDZXsDV+MmWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:45:16.065200Z"},"content_sha256":"797fe86b6383323793a16ba4c963b99b8ffec6d70fbe2d3fb5f8e548a9ef9cc9","schema_version":"1.0","event_id":"sha256:797fe86b6383323793a16ba4c963b99b8ffec6d70fbe2d3fb5f8e548a9ef9cc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IV3GGVFH4J23UCYI7KDD3TN666","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Several families of ternary negacyclic codes and their duals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Zhonghua Sun","submitted_at":"2023-01-24T01:59:16Z","abstract_excerpt":"Constacyclic codes contain cyclic codes as a subclass and have nice algebraic structures. Constacyclic codes have theoretical importance, as they are connected to a number of areas of mathematics and outperform cyclic codes in several aspects. Negacyclic codes are a subclass of constacyclic codes and are distance-optimal in many cases. However, compared with the extensive study of cyclic codes, negacyclic codes are much less studied. In this paper, several families of ternary negacyclic codes and their duals are constructed and analysed. These families of negacyclic codes and their duals conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09783","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.09783/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-05T05:35:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qnmz9sviowmEJCpECGadIpvmDXEuEOqAQvikyhvwWyWWINvuEjh/7VCoy/aEIFhP6oC40O9vk6E2LZogKCyHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T19:45:16.065695Z"},"content_sha256":"6013b85e9cff429697950540f100f12622a3b792d06d8e41c36585e0d564ee5c","schema_version":"1.0","event_id":"sha256:6013b85e9cff429697950540f100f12622a3b792d06d8e41c36585e0d564ee5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IV3GGVFH4J23UCYI7KDD3TN666/bundle.json","state_url":"https://pith.science/pith/IV3GGVFH4J23UCYI7KDD3TN666/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IV3GGVFH4J23UCYI7KDD3TN666/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-08-09T19:45:16Z","links":{"resolver":"https://pith.science/pith/IV3GGVFH4J23UCYI7KDD3TN666","bundle":"https://pith.science/pith/IV3GGVFH4J23UCYI7KDD3TN666/bundle.json","state":"https://pith.science/pith/IV3GGVFH4J23UCYI7KDD3TN666/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IV3GGVFH4J23UCYI7KDD3TN666/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IV3GGVFH4J23UCYI7KDD3TN666","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":"24e77e506c0ad623bc5b54beb18f6746d7bc78afa9d2b8f48e351b4e9a68c069","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:59:16Z","title_canon_sha256":"81630f1e37752eecfd7d4d32ea09321362bb2a0133dcb19c78b59fb27e4e1026"},"schema_version":"1.0","source":{"id":"2301.09783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.09783","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"arxiv_version","alias_value":"2301.09783v2","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09783","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_12","alias_value":"IV3GGVFH4J23","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_16","alias_value":"IV3GGVFH4J23UCYI","created_at":"2026-07-05T05:35:48Z"},{"alias_kind":"pith_short_8","alias_value":"IV3GGVFH","created_at":"2026-07-05T05:35:48Z"}],"graph_snapshots":[{"event_id":"sha256:6013b85e9cff429697950540f100f12622a3b792d06d8e41c36585e0d564ee5c","target":"graph","created_at":"2026-07-05T05:35:48Z","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/2301.09783/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constacyclic codes contain cyclic codes as a subclass and have nice algebraic structures. Constacyclic codes have theoretical importance, as they are connected to a number of areas of mathematics and outperform cyclic codes in several aspects. Negacyclic codes are a subclass of constacyclic codes and are distance-optimal in many cases. However, compared with the extensive study of cyclic codes, negacyclic codes are much less studied. In this paper, several families of ternary negacyclic codes and their duals are constructed and analysed. These families of negacyclic codes and their duals conta","authors_text":"Cunsheng Ding, Zhonghua Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:59:16Z","title":"Several families of ternary negacyclic codes and their duals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09783","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:797fe86b6383323793a16ba4c963b99b8ffec6d70fbe2d3fb5f8e548a9ef9cc9","target":"record","created_at":"2026-07-05T05:35:48Z","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":"24e77e506c0ad623bc5b54beb18f6746d7bc78afa9d2b8f48e351b4e9a68c069","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:59:16Z","title_canon_sha256":"81630f1e37752eecfd7d4d32ea09321362bb2a0133dcb19c78b59fb27e4e1026"},"schema_version":"1.0","source":{"id":"2301.09783","kind":"arxiv","version":2}},"canonical_sha256":"45766354a7e275ba0b08fa863dcdbef79a59704dc01867982e5d0b6ab746f831","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45766354a7e275ba0b08fa863dcdbef79a59704dc01867982e5d0b6ab746f831","first_computed_at":"2026-07-05T05:35:48.852305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:35:48.852305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QL6VekjLsUS8NafWtshTkvZPI530A8H7wsS2impE5PFsLnKpqvKxTegISc5mCP+hWzqUQxEY26h01KoEg0tdAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:35:48.852861Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.09783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:797fe86b6383323793a16ba4c963b99b8ffec6d70fbe2d3fb5f8e548a9ef9cc9","sha256:6013b85e9cff429697950540f100f12622a3b792d06d8e41c36585e0d564ee5c"],"state_sha256":"b688442992bd7fa2b67cad4d2647e429f1c7e3aed3134ebfd7f2d799e5b7b5c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1+W9G9PCRoSjxeJfQSWQ3zvKiTST2XI2NzoCkCU/6ZQ2eYaU/VpDrOIr3pSl+cql8NpDq6/o1t8r2imBn8cDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T19:45:16.070968Z","bundle_sha256":"1d152d1c73b5ad988995815ef7c23fcd93fbbe17769150f45f8fe0bbfc4218aa"}}