{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UWJW6WBRCNDBJPDIBX73AHKCWH","short_pith_number":"pith:UWJW6WBR","canonical_record":{"source":{"id":"2605.19857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T13:49:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4d1e2e598824ca7c19429c3158b21e8d302fc0cfb16737e6f36ef0f85943eeb5","abstract_canon_sha256":"01a34eee18cb5e565a103af5e63000346da573760f77ede145038b869a8adbf8"},"schema_version":"1.0"},"canonical_sha256":"a5936f5831134614bc680dffb01d42b1ef3b0b2850fc33af70480f5a2d5064b0","source":{"kind":"arxiv","id":"2605.19857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19857","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19857v1","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19857","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"UWJW6WBRCNDB","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"UWJW6WBRCNDBJPDI","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"UWJW6WBR","created_at":"2026-05-20T01:06:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UWJW6WBRCNDBJPDIBX73AHKCWH","target":"record","payload":{"canonical_record":{"source":{"id":"2605.19857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T13:49:46Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4d1e2e598824ca7c19429c3158b21e8d302fc0cfb16737e6f36ef0f85943eeb5","abstract_canon_sha256":"01a34eee18cb5e565a103af5e63000346da573760f77ede145038b869a8adbf8"},"schema_version":"1.0"},"canonical_sha256":"a5936f5831134614bc680dffb01d42b1ef3b0b2850fc33af70480f5a2d5064b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:06:17.911558Z","signature_b64":"m01Kdu7FBPyTF7C2ym2ffzamGUOVeXwi+Fitl0TL4pUB5RZxam9fOmtIhbrOY3HPOOm95qVSIiUuLismDgoVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5936f5831134614bc680dffb01d42b1ef3b0b2850fc33af70480f5a2d5064b0","last_reissued_at":"2026-05-20T01:06:17.910833Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:06:17.910833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.19857","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-20T01:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kkxc0dIL6HQn5rEfOBvN0UlJ4xrOzjBG8PTbediMgW/uthCVzHHK5D7yYrHKpsfBgcTTHk6xhl6diC+cbVUYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:31:20.215538Z"},"content_sha256":"96af7e7cdd8ca72bc7224b959f1a5b7c14269f4de4fbe25b56fb3da2491ebe27","schema_version":"1.0","event_id":"sha256:96af7e7cdd8ca72bc7224b959f1a5b7c14269f4de4fbe25b56fb3da2491ebe27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UWJW6WBRCNDBJPDIBX73AHKCWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Divisibility of Trace Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Haihua Deng, Hexiang Huang, Sihuang Hu","submitted_at":"2026-05-19T13:49:46Z","abstract_excerpt":"A linear code is said to be $\\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this paper, we establish a divisibility criterion for trace codes. Specifically, this criterion provides a systematic method to determine the $p$-adic valuation of the associated trace code, thereby extending Ward's classical divisibility criterion from standard generating sets (or matrices) to generalized generator matrices over an extension field. Furthermore, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19857","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/2605.19857/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-05-20T01:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLWyt3aS4u050L2eJFyOcyBo8wdrEbF3HJb0yMiXjA7Cbt/c26hpxhHnq9Dzt78gt7WniHrd1GBAUzYWoTIoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:31:20.216257Z"},"content_sha256":"45c4b638117c2177f1a68983833a310b00586eba0e8d959fef3de313a97a1c3a","schema_version":"1.0","event_id":"sha256:45c4b638117c2177f1a68983833a310b00586eba0e8d959fef3de313a97a1c3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/bundle.json","state_url":"https://pith.science/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/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-05-22T15:31:20Z","links":{"resolver":"https://pith.science/pith/UWJW6WBRCNDBJPDIBX73AHKCWH","bundle":"https://pith.science/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/bundle.json","state":"https://pith.science/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWJW6WBRCNDBJPDIBX73AHKCWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UWJW6WBRCNDBJPDIBX73AHKCWH","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":"01a34eee18cb5e565a103af5e63000346da573760f77ede145038b869a8adbf8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T13:49:46Z","title_canon_sha256":"4d1e2e598824ca7c19429c3158b21e8d302fc0cfb16737e6f36ef0f85943eeb5"},"schema_version":"1.0","source":{"id":"2605.19857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.19857","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.19857v1","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19857","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"UWJW6WBRCNDB","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_16","alias_value":"UWJW6WBRCNDBJPDI","created_at":"2026-05-20T01:06:17Z"},{"alias_kind":"pith_short_8","alias_value":"UWJW6WBR","created_at":"2026-05-20T01:06:17Z"}],"graph_snapshots":[{"event_id":"sha256:45c4b638117c2177f1a68983833a310b00586eba0e8d959fef3de313a97a1c3a","target":"graph","created_at":"2026-05-20T01:06:17Z","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/2605.19857/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A linear code is said to be $\\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this paper, we establish a divisibility criterion for trace codes. Specifically, this criterion provides a systematic method to determine the $p$-adic valuation of the associated trace code, thereby extending Ward's classical divisibility criterion from standard generating sets (or matrices) to generalized generator matrices over an extension field. Furthermore, we ","authors_text":"Haihua Deng, Hexiang Huang, Sihuang Hu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T13:49:46Z","title":"Divisibility of Trace Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19857","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:96af7e7cdd8ca72bc7224b959f1a5b7c14269f4de4fbe25b56fb3da2491ebe27","target":"record","created_at":"2026-05-20T01:06:17Z","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":"01a34eee18cb5e565a103af5e63000346da573760f77ede145038b869a8adbf8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T13:49:46Z","title_canon_sha256":"4d1e2e598824ca7c19429c3158b21e8d302fc0cfb16737e6f36ef0f85943eeb5"},"schema_version":"1.0","source":{"id":"2605.19857","kind":"arxiv","version":1}},"canonical_sha256":"a5936f5831134614bc680dffb01d42b1ef3b0b2850fc33af70480f5a2d5064b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5936f5831134614bc680dffb01d42b1ef3b0b2850fc33af70480f5a2d5064b0","first_computed_at":"2026-05-20T01:06:17.910833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:17.910833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m01Kdu7FBPyTF7C2ym2ffzamGUOVeXwi+Fitl0TL4pUB5RZxam9fOmtIhbrOY3HPOOm95qVSIiUuLismDgoVBw==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:17.911558Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.19857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96af7e7cdd8ca72bc7224b959f1a5b7c14269f4de4fbe25b56fb3da2491ebe27","sha256:45c4b638117c2177f1a68983833a310b00586eba0e8d959fef3de313a97a1c3a"],"state_sha256":"f2243d3f55665dff623ee2b491a95dac51d6b3e17e86c1fcb09561cde0a0c474"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zP4F1LZYLxj9XjBYcvLEFkBicFgOcGhv5I741FcvIE7LAcq/S3yDzzDb+xrp8W126nDxErNEqy4WkrXrseO1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:31:20.219771Z","bundle_sha256":"43ec4309ecc4b6721513cd995a0e1a5cf85dfc1f0a8a07089d141d13f186ca95"}}