{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IZFUKCQMSMCR6PD4H6FLK2HBUP","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":"d2e47c72d8afca3f226a64196e89c81cda84c7677d1f92dad5e2c5f14c3bfff4","cross_cats_sorted":["cs.IT","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T06:39:07Z","title_canon_sha256":"55549fa970aeef04767ef5a26a6d4c2195e0cad9fb52584fcfe64bd33e6910c0"},"schema_version":"1.0","source":{"id":"2505.17531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17531","created_at":"2026-07-05T11:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17531v1","created_at":"2026-07-05T11:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17531","created_at":"2026-07-05T11:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"IZFUKCQMSMCR","created_at":"2026-07-05T11:08:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZFUKCQMSMCR6PD4","created_at":"2026-07-05T11:08:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZFUKCQM","created_at":"2026-07-05T11:08:27Z"}],"graph_snapshots":[{"event_id":"sha256:0ea3e54ff79c7dbd1d08236618c9a8d16a169fcc3f584308cdf21bb2143ec99c","target":"graph","created_at":"2026-07-05T11:08:27Z","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/2505.17531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"To each nodal hypersurface one can associate a binary linear code. Here we show that the binary linear code associated to sextics in $\\mathbb{P}^3$ with the maximum number of $65$ nodes, as e.g. the Barth sextic, is unique. We also state possible candidates for codes that might be associated with a hypothetical septic attaining the currently best known upper bound for the maximum number of nodes.","authors_text":"Sascha Kurz","cross_cats":["cs.IT","math.AG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T06:39:07Z","title":"Nodal surfaces in $\\mathbb{P}^3$ and coding theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17531","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:771a5d453ee66f3dcbbc34bf429d5be838cdb2984f0ba337d56f271dcfe96fbc","target":"record","created_at":"2026-07-05T11:08:27Z","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":"d2e47c72d8afca3f226a64196e89c81cda84c7677d1f92dad5e2c5f14c3bfff4","cross_cats_sorted":["cs.IT","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T06:39:07Z","title_canon_sha256":"55549fa970aeef04767ef5a26a6d4c2195e0cad9fb52584fcfe64bd33e6910c0"},"schema_version":"1.0","source":{"id":"2505.17531","kind":"arxiv","version":1}},"canonical_sha256":"464b450a0c93051f3c7c3f8ab568e1a3dd9db8360a105ffc532b5ba3f1088226","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"464b450a0c93051f3c7c3f8ab568e1a3dd9db8360a105ffc532b5ba3f1088226","first_computed_at":"2026-07-05T11:08:27.722369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:27.722369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aNgSbLFHeKYStuwGYWIMyYdvfF0WtcGUuwZqfRM+tBUlZafRJqvXJMoFgDB/E4qmRVA+9gS5dBffYQP24ciPDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:27.722997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:771a5d453ee66f3dcbbc34bf429d5be838cdb2984f0ba337d56f271dcfe96fbc","sha256:0ea3e54ff79c7dbd1d08236618c9a8d16a169fcc3f584308cdf21bb2143ec99c"],"state_sha256":"56e5fbda8f98c79d9a54746c5dce058a713536d4c08153998104e56608f3579d"}