{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SLUFO3AARJXNGCAF2SXIRA5R2F","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":"08408f0a333efa72cf964e4756ef35d114037a0d5f73e1d2575868402c348d8c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-30T18:01:48Z","title_canon_sha256":"b355d5870676d1d474b1e3a1c6ac6a73dd8e913cccf9b16a558b54a36006a2ce"},"schema_version":"1.0","source":{"id":"2310.19891","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.19891","created_at":"2026-07-05T08:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"2310.19891v2","created_at":"2026-07-05T08:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19891","created_at":"2026-07-05T08:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"SLUFO3AARJXN","created_at":"2026-07-05T08:10:57Z"},{"alias_kind":"pith_short_16","alias_value":"SLUFO3AARJXNGCAF","created_at":"2026-07-05T08:10:57Z"},{"alias_kind":"pith_short_8","alias_value":"SLUFO3AA","created_at":"2026-07-05T08:10:57Z"}],"graph_snapshots":[{"event_id":"sha256:9f5b25dac497a1dd6a9edc192c292b9fd260c488307053339dc58951d1fab7ba","target":"graph","created_at":"2026-07-05T08:10:57Z","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/2310.19891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A linear graph code is a family $\\mathcal{C}$ of graphs on $n$ vertices with the property that the symmetric difference of the edge sets of any two graphs in $\\mathcal{C}$ is also the edge set of a graph in $\\mathcal{C}$. In this article, we investigate the maximal size of a linear graph code that does not contain a copy of a fixed graph $H$. In particular, we show that if $H$ has an even number of edges, the size of the code is $O(2^{\\binom{n}{2}}/\\log n)$, making progress on a question of Alon. Furthermore, we show that for almost all graphs $H$ with an even number of edges, there exists $\\v","authors_text":"Leo Versteegen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-30T18:01:48Z","title":"Upper bounds for linear graph codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19891","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:02922a584e3677c0485720ea072a3433da3cb9fad65486ad8cc2ca2e046f768f","target":"record","created_at":"2026-07-05T08:10:57Z","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":"08408f0a333efa72cf964e4756ef35d114037a0d5f73e1d2575868402c348d8c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-30T18:01:48Z","title_canon_sha256":"b355d5870676d1d474b1e3a1c6ac6a73dd8e913cccf9b16a558b54a36006a2ce"},"schema_version":"1.0","source":{"id":"2310.19891","kind":"arxiv","version":2}},"canonical_sha256":"92e8576c008a6ed30805d4ae8883b1d14f23f7388cda3a2ad64637705cbc72ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92e8576c008a6ed30805d4ae8883b1d14f23f7388cda3a2ad64637705cbc72ac","first_computed_at":"2026-07-05T08:10:57.976055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:57.976055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RNRG/0e6+Wd9D6e7YJUbAsQpsYbqdI4XiH/jZvAq+u603cVBNYC7OGqz+g3H6Fah981/ey4552Clj0d3wXxCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:57.976428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.19891","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02922a584e3677c0485720ea072a3433da3cb9fad65486ad8cc2ca2e046f768f","sha256:9f5b25dac497a1dd6a9edc192c292b9fd260c488307053339dc58951d1fab7ba"],"state_sha256":"16bc7c2870a92b1d37b94593244fa55bd770097aa7c4c0047000bdd5713da7cd"}