{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4W2VVPJBHU3CEVYWBQWJA5RKRE","short_pith_number":"pith:4W2VVPJB","schema_version":"1.0","canonical_sha256":"e5b55abd213d362257160c2c90762a8910b75285a142e4bfd345b827d49b2d4b","source":{"kind":"arxiv","id":"2607.07479","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial constructions of Schubert subspace codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Beatrice Toesca, Gianira N. Alfarano","submitted_at":"2026-07-08T14:43:07Z","abstract_excerpt":"We study Schubert subspace codes, which are constant-dimension subspace codes with prescribed intersection conditions with a fixed subspace. Our goal is to construct codes of maximum possible size in the extremal distance cases where a natural counting upper bound applies. We give two families of constructions. The first one uses a direct-sum decomposition of the ambient space, together with partial spreads and colorings of powers of $q$-Johnson graphs. For this construction, we also prove necessary conditions, which show how chromatic and clique obstructions arise. The second family is obtain"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.07479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-08T14:43:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"154ca658ec5a8f992a7759b668b3b9a5a55dd0e259e71113f354130c504e51b5","abstract_canon_sha256":"5f6755dd7462ce130c0a427c21dbe80d7cd2f29321919b17d27af2a3a29671e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:25.970422Z","signature_b64":"ylz1uIPrRi5WGdr2XP2tXSKX3q4Hm5wdYRrLgFI2pofBjaRL+j0W7C+JpDHinbeCv/hM/fM8eLscSp6erTvsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b55abd213d362257160c2c90762a8910b75285a142e4bfd345b827d49b2d4b","last_reissued_at":"2026-07-09T01:20:25.970071Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:25.970071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial constructions of Schubert subspace codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Alessandro Neri, Beatrice Toesca, Gianira N. Alfarano","submitted_at":"2026-07-08T14:43:07Z","abstract_excerpt":"We study Schubert subspace codes, which are constant-dimension subspace codes with prescribed intersection conditions with a fixed subspace. Our goal is to construct codes of maximum possible size in the extremal distance cases where a natural counting upper bound applies. We give two families of constructions. The first one uses a direct-sum decomposition of the ambient space, together with partial spreads and colorings of powers of $q$-Johnson graphs. For this construction, we also prove necessary conditions, which show how chromatic and clique obstructions arise. The second family is obtain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07479","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/2607.07479/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.07479","created_at":"2026-07-09T01:20:25.970133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07479v1","created_at":"2026-07-09T01:20:25.970133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07479","created_at":"2026-07-09T01:20:25.970133+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W2VVPJBHU3C","created_at":"2026-07-09T01:20:25.970133+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W2VVPJBHU3CEVYW","created_at":"2026-07-09T01:20:25.970133+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W2VVPJB","created_at":"2026-07-09T01:20:25.970133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE","json":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE.json","graph_json":"https://pith.science/api/pith-number/4W2VVPJBHU3CEVYWBQWJA5RKRE/graph.json","events_json":"https://pith.science/api/pith-number/4W2VVPJBHU3CEVYWBQWJA5RKRE/events.json","paper":"https://pith.science/paper/4W2VVPJB"},"agent_actions":{"view_html":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE","download_json":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE.json","view_paper":"https://pith.science/paper/4W2VVPJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07479&json=true","fetch_graph":"https://pith.science/api/pith-number/4W2VVPJBHU3CEVYWBQWJA5RKRE/graph.json","fetch_events":"https://pith.science/api/pith-number/4W2VVPJBHU3CEVYWBQWJA5RKRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE/action/storage_attestation","attest_author":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE/action/author_attestation","sign_citation":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE/action/citation_signature","submit_replication":"https://pith.science/pith/4W2VVPJBHU3CEVYWBQWJA5RKRE/action/replication_record"}},"created_at":"2026-07-09T01:20:25.970133+00:00","updated_at":"2026-07-09T01:20:25.970133+00:00"}