{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TK4RJ2NEJIIJBA7IRJC2KD3QNE","short_pith_number":"pith:TK4RJ2NE","canonical_record":{"source":{"id":"1912.10147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-20T23:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"1166c1e6160b9cb6ddb9331844803bb4c52aa95ccb2b0979e3dd449e4f5f8aa8","abstract_canon_sha256":"2f5a238279e207de53db50ebbe57d51dc09c413854d1d7a1601ede5891cc42ac"},"schema_version":"1.0"},"canonical_sha256":"9ab914e9a44a109083e88a45a50f70691b2f5c626fe7d9f5bb2cd726ec35b9d1","source":{"kind":"arxiv","id":"1912.10147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.10147","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1912.10147v1","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.10147","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"TK4RJ2NEJIIJ","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_16","alias_value":"TK4RJ2NEJIIJBA7I","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_8","alias_value":"TK4RJ2NE","created_at":"2026-07-05T00:27:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TK4RJ2NEJIIJBA7IRJC2KD3QNE","target":"record","payload":{"canonical_record":{"source":{"id":"1912.10147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-20T23:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"1166c1e6160b9cb6ddb9331844803bb4c52aa95ccb2b0979e3dd449e4f5f8aa8","abstract_canon_sha256":"2f5a238279e207de53db50ebbe57d51dc09c413854d1d7a1601ede5891cc42ac"},"schema_version":"1.0"},"canonical_sha256":"9ab914e9a44a109083e88a45a50f70691b2f5c626fe7d9f5bb2cd726ec35b9d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:47.242196Z","signature_b64":"HW9KQh2QFQQKwxrhotPdLjoI5MkAE8MG0cyzu+1b1PWTD7Lclt+7QJoSG/f5T4mblCQHHIXbjL2xwIR0CxO4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ab914e9a44a109083e88a45a50f70691b2f5c626fe7d9f5bb2cd726ec35b9d1","last_reissued_at":"2026-07-05T00:27:47.241663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:47.241663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.10147","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YpUgTYBWc/pxTyCsP8I0u6pzFmBU6M3LsLsAiW91U72/G1jTnYlTGnqe3TCgCExtzFhBinCqAxWoLiKAefBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:21:27.501759Z"},"content_sha256":"1edf23f0baf3aaa0c2e411f204c2807c5cb1fb5477be150a6e5fe6560ca96147","schema_version":"1.0","event_id":"sha256:1edf23f0baf3aaa0c2e411f204c2807c5cb1fb5477be150a6e5fe6560ca96147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TK4RJ2NEJIIJBA7IRJC2KD3QNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On projective $q^r$-divisible codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Thomas Honold","submitted_at":"2019-12-20T23:40:28Z","abstract_excerpt":"A projective linear code over $\\mathbb{F}_q$ is called $\\Delta$-divisible if all weights of its codewords are divisible by $\\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications of collections of subspaces in $\\mathbb{F}_q^v$. One example are upper bounds on the cardinality of partial spreads. Here we survey the known results on the possible lengths of projective $q^r$-divisible linear codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.10147","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.10147/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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsjH0t3drW17yfsFlzx6ab/2jKjpDCDNLn4CsAXutIKSy84EYGHWKXRcfHovOr2nxBylkKZbp09sNxxntptiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:21:27.502575Z"},"content_sha256":"c6be67c98a62d37c223116370793655dc39352732239e531712457dc6c4f7e62","schema_version":"1.0","event_id":"sha256:c6be67c98a62d37c223116370793655dc39352732239e531712457dc6c4f7e62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/bundle.json","state_url":"https://pith.science/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/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-12T04:21:27Z","links":{"resolver":"https://pith.science/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE","bundle":"https://pith.science/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/bundle.json","state":"https://pith.science/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TK4RJ2NEJIIJBA7IRJC2KD3QNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TK4RJ2NEJIIJBA7IRJC2KD3QNE","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":"2f5a238279e207de53db50ebbe57d51dc09c413854d1d7a1601ede5891cc42ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-20T23:40:28Z","title_canon_sha256":"1166c1e6160b9cb6ddb9331844803bb4c52aa95ccb2b0979e3dd449e4f5f8aa8"},"schema_version":"1.0","source":{"id":"1912.10147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.10147","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1912.10147v1","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.10147","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"TK4RJ2NEJIIJ","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_16","alias_value":"TK4RJ2NEJIIJBA7I","created_at":"2026-07-05T00:27:47Z"},{"alias_kind":"pith_short_8","alias_value":"TK4RJ2NE","created_at":"2026-07-05T00:27:47Z"}],"graph_snapshots":[{"event_id":"sha256:c6be67c98a62d37c223116370793655dc39352732239e531712457dc6c4f7e62","target":"graph","created_at":"2026-07-05T00:27:47Z","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.10147/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A projective linear code over $\\mathbb{F}_q$ is called $\\Delta$-divisible if all weights of its codewords are divisible by $\\Delta$. Especially, $q^r$-divisible projective linear codes, where $r$ is some integer, arise in many applications of collections of subspaces in $\\mathbb{F}_q^v$. One example are upper bounds on the cardinality of partial spreads. Here we survey the known results on the possible lengths of projective $q^r$-divisible linear codes.","authors_text":"Alfred Wassermann, Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Thomas Honold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-20T23:40:28Z","title":"On projective $q^r$-divisible codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.10147","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:1edf23f0baf3aaa0c2e411f204c2807c5cb1fb5477be150a6e5fe6560ca96147","target":"record","created_at":"2026-07-05T00:27:47Z","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":"2f5a238279e207de53db50ebbe57d51dc09c413854d1d7a1601ede5891cc42ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-20T23:40:28Z","title_canon_sha256":"1166c1e6160b9cb6ddb9331844803bb4c52aa95ccb2b0979e3dd449e4f5f8aa8"},"schema_version":"1.0","source":{"id":"1912.10147","kind":"arxiv","version":1}},"canonical_sha256":"9ab914e9a44a109083e88a45a50f70691b2f5c626fe7d9f5bb2cd726ec35b9d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ab914e9a44a109083e88a45a50f70691b2f5c626fe7d9f5bb2cd726ec35b9d1","first_computed_at":"2026-07-05T00:27:47.241663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:27:47.241663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HW9KQh2QFQQKwxrhotPdLjoI5MkAE8MG0cyzu+1b1PWTD7Lclt+7QJoSG/f5T4mblCQHHIXbjL2xwIR0CxO4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:27:47.242196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.10147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1edf23f0baf3aaa0c2e411f204c2807c5cb1fb5477be150a6e5fe6560ca96147","sha256:c6be67c98a62d37c223116370793655dc39352732239e531712457dc6c4f7e62"],"state_sha256":"56d12ef3702cd61e3e18866825b1a697e801fdd1e941d584db39d2ae15c19979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aK+THINQFAy2CvOzwLzLZQtFTD129YPdDVsfLUyL21xSK2guxJ8IqytlhyD+L7zfGpLuYXs4ChqqI00zXVoxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T04:21:27.507914Z","bundle_sha256":"2e1eb5238eec422a12ae831e7e7be225524bae5529ebc15dedcefff58ad2128f"}}