{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:4NZZB7HAGVS7R2Z2LPR3SWZ4XW","short_pith_number":"pith:4NZZB7HA","schema_version":"1.0","canonical_sha256":"e37390fce03565f8eb3a5be3b95b3cbdb08dcaf1a3fe94017b9968cbf5a0dcd1","source":{"kind":"arxiv","id":"cs/0408011","version":1},"attestation_state":"computed","paper":{"title":"The asymptotic number of binary codes and binary matroids","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcel Wild","submitted_at":"2004-08-04T14:46:49Z","abstract_excerpt":"The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all binary n-codes have a trivial automorphism group."},"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":"cs/0408011","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2004-08-04T14:46:49Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"f30dcbac6dcd65ed587ba8ee89e7248b6036a2435af2c9f7688fcfd5ae842e2c","abstract_canon_sha256":"93074281026ef617e2616ddf1f9a36e0bbbd657ba7ce2dea979c40ebf95bb4a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:47.616379Z","signature_b64":"SIXdyMW5QIk2yMMRRofLemU4aJTXopaWwcrDLT4T6ahScnQ24ekCR1wP5SRsb5h2IQjhudUoTDO0vAQFnobcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37390fce03565f8eb3a5be3b95b3cbdb08dcaf1a3fe94017b9968cbf5a0dcd1","last_reissued_at":"2026-05-18T00:49:47.615752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:47.615752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The asymptotic number of binary codes and binary matroids","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Marcel Wild","submitted_at":"2004-08-04T14:46:49Z","abstract_excerpt":"The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all binary n-codes have a trivial automorphism group."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0408011","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":""},"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":"cs/0408011","created_at":"2026-05-18T00:49:47.615849+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0408011v1","created_at":"2026-05-18T00:49:47.615849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0408011","created_at":"2026-05-18T00:49:47.615849+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NZZB7HAGVS7","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NZZB7HAGVS7R2Z2","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NZZB7HA","created_at":"2026-05-18T12:25:52.051335+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/4NZZB7HAGVS7R2Z2LPR3SWZ4XW","json":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW.json","graph_json":"https://pith.science/api/pith-number/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/graph.json","events_json":"https://pith.science/api/pith-number/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/events.json","paper":"https://pith.science/paper/4NZZB7HA"},"agent_actions":{"view_html":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW","download_json":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW.json","view_paper":"https://pith.science/paper/4NZZB7HA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0408011&json=true","fetch_graph":"https://pith.science/api/pith-number/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/graph.json","fetch_events":"https://pith.science/api/pith-number/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/action/storage_attestation","attest_author":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/action/author_attestation","sign_citation":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/action/citation_signature","submit_replication":"https://pith.science/pith/4NZZB7HAGVS7R2Z2LPR3SWZ4XW/action/replication_record"}},"created_at":"2026-05-18T00:49:47.615849+00:00","updated_at":"2026-05-18T00:49:47.615849+00:00"}