{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ODSAJMKWWBHVTZXAVJCC7TJQRK","short_pith_number":"pith:ODSAJMKW","canonical_record":{"source":{"id":"1912.12769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"d2246803519862626e411dfc72276f2ff556f02f3bd10943de37612a7aeda3c4","abstract_canon_sha256":"d1c2cfed1eeb308f5c2217dc14501986bc838579f932aaa413206f44276898c7"},"schema_version":"1.0"},"canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","source":{"kind":"arxiv","id":"1912.12769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.12769","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1912.12769v1","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12769","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"ODSAJMKWWBHV","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_16","alias_value":"ODSAJMKWWBHVTZXA","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_8","alias_value":"ODSAJMKW","created_at":"2026-07-05T00:29:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ODSAJMKWWBHVTZXAVJCC7TJQRK","target":"record","payload":{"canonical_record":{"source":{"id":"1912.12769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"d2246803519862626e411dfc72276f2ff556f02f3bd10943de37612a7aeda3c4","abstract_canon_sha256":"d1c2cfed1eeb308f5c2217dc14501986bc838579f932aaa413206f44276898c7"},"schema_version":"1.0"},"canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:03.256755Z","signature_b64":"bw6NFOHbCGTBUh+UbPiQQvWP4jSYifEtDYstFmoYYTjlIM9uApBzciEm0nbghnaIjlEBK/MZ5syAQAaPO+k4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","last_reissued_at":"2026-07-05T00:29:03.256424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:03.256424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.12769","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-05T00:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PbiRKmRMM8zeO8pgWN1r1JRQydyTvKiP2aG1JAsF/UgsetSsipTUj229LGDwqntctlBNHi+14tVX/Fa1eDzzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:32:06.001149Z"},"content_sha256":"df8c318ffc677039521f2d27a27c2cbdfb6da4e158d625fcd628fab886dd921e","schema_version":"1.0","event_id":"sha256:df8c318ffc677039521f2d27a27c2cbdfb6da4e158d625fcd628fab886dd921e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ODSAJMKWWBHVTZXAVJCC7TJQRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julien Sorci","submitted_at":"2019-12-30T01:01:53Z","abstract_excerpt":"A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition for a code to be minimal, which led to much interest in constructing minimal codes that do not satisfy their condition. We consider a particular family of codes $\\mathcal C_f$ when $f$ is the indicator function of a set of points, and prove a sufficient condition for $\\mathcal C_f$ to be minimal and not satisfy Ashikhmin and Barg's condition based on certain g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12769","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/1912.12769/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-05T00:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGjl+rjct7fKfbt9lRRkAijY/yJwoe1pZoC1cfwTdZr0ARpidY1a9G2hQsE1K5fEkSncwGGU4fxKrfe0sQO9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:32:06.001533Z"},"content_sha256":"d8726f77e7e86765ec5138746ee0f6ea89331ff26ed47141160d6326cb0578ff","schema_version":"1.0","event_id":"sha256:d8726f77e7e86765ec5138746ee0f6ea89331ff26ed47141160d6326cb0578ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/bundle.json","state_url":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/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-06T13:32:06Z","links":{"resolver":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK","bundle":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/bundle.json","state":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ODSAJMKWWBHVTZXAVJCC7TJQRK","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":"d1c2cfed1eeb308f5c2217dc14501986bc838579f932aaa413206f44276898c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","title_canon_sha256":"d2246803519862626e411dfc72276f2ff556f02f3bd10943de37612a7aeda3c4"},"schema_version":"1.0","source":{"id":"1912.12769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.12769","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1912.12769v1","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12769","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"ODSAJMKWWBHV","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_16","alias_value":"ODSAJMKWWBHVTZXA","created_at":"2026-07-05T00:29:03Z"},{"alias_kind":"pith_short_8","alias_value":"ODSAJMKW","created_at":"2026-07-05T00:29:03Z"}],"graph_snapshots":[{"event_id":"sha256:d8726f77e7e86765ec5138746ee0f6ea89331ff26ed47141160d6326cb0578ff","target":"graph","created_at":"2026-07-05T00:29:03Z","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/1912.12769/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition for a code to be minimal, which led to much interest in constructing minimal codes that do not satisfy their condition. We consider a particular family of codes $\\mathcal C_f$ when $f$ is the indicator function of a set of points, and prove a sufficient condition for $\\mathcal C_f$ to be minimal and not satisfy Ashikhmin and Barg's condition based on certain g","authors_text":"Julien Sorci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","title":"Minimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12769","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:df8c318ffc677039521f2d27a27c2cbdfb6da4e158d625fcd628fab886dd921e","target":"record","created_at":"2026-07-05T00:29:03Z","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":"d1c2cfed1eeb308f5c2217dc14501986bc838579f932aaa413206f44276898c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","title_canon_sha256":"d2246803519862626e411dfc72276f2ff556f02f3bd10943de37612a7aeda3c4"},"schema_version":"1.0","source":{"id":"1912.12769","kind":"arxiv","version":1}},"canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","first_computed_at":"2026-07-05T00:29:03.256424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:03.256424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bw6NFOHbCGTBUh+UbPiQQvWP4jSYifEtDYstFmoYYTjlIM9uApBzciEm0nbghnaIjlEBK/MZ5syAQAaPO+k4AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:03.256755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.12769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df8c318ffc677039521f2d27a27c2cbdfb6da4e158d625fcd628fab886dd921e","sha256:d8726f77e7e86765ec5138746ee0f6ea89331ff26ed47141160d6326cb0578ff"],"state_sha256":"5a2c9d652c1c801034ad86a90e0661f94646d83b6e477998ed956ed005cddb54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JJCRwl0TdZ+k/ylfpuKptQrmYW5GmxWPHhookA2DzTNyY624JSKKC6CbIzdl4MJuTq+SKoYcz6rQjKfkWTfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:32:06.003511Z","bundle_sha256":"157d28c0ec9d7d93273e474343246af55523302fea94044613ccb2742d985d0a"}}