{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:Q3BXCII5ABQ5G4BMD3NPFVDNFY","short_pith_number":"pith:Q3BXCII5","schema_version":"1.0","canonical_sha256":"86c371211d0061d3702c1edaf2d46d2e12448c07cdcd0ff46a5d5857545719f6","source":{"kind":"arxiv","id":"0902.1634","version":2},"attestation_state":"computed","paper":{"title":"A bound on the size of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonora Guerrini, Massimiliano Sala","submitted_at":"2009-02-10T11:50:48Z","abstract_excerpt":"We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound."},"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":"0902.1634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-10T11:50:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2a912faece127fbca71a3aa1cea3534f3899a679bf642104f8440f3126f56e01","abstract_canon_sha256":"bb5574e10fca65784003b03650a86dd7b775d6831b3db5a0f3bd1d91b42fa098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:28.693798Z","signature_b64":"1wzZ5aPyoOsFp2WXqIu+dAhRiK4+9LNgOQR9vYLz8ct5r0/0WAzx+FvxMMNksW9ZhiI7eDNs08ouZiC5zq0pDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86c371211d0061d3702c1edaf2d46d2e12448c07cdcd0ff46a5d5857545719f6","last_reissued_at":"2026-05-18T03:52:28.693102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:28.693102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bound on the size of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleonora Guerrini, Massimiliano Sala","submitted_at":"2009-02-10T11:50:48Z","abstract_excerpt":"We present a bound on the size of linear codes. This bound is independent of other known bounds, e.g. the Griesmer bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1634","kind":"arxiv","version":2},"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":"0902.1634","created_at":"2026-05-18T03:52:28.693217+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.1634v2","created_at":"2026-05-18T03:52:28.693217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1634","created_at":"2026-05-18T03:52:28.693217+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3BXCII5ABQ5","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3BXCII5ABQ5G4BM","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3BXCII5","created_at":"2026-05-18T12:26:01.383474+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/Q3BXCII5ABQ5G4BMD3NPFVDNFY","json":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY.json","graph_json":"https://pith.science/api/pith-number/Q3BXCII5ABQ5G4BMD3NPFVDNFY/graph.json","events_json":"https://pith.science/api/pith-number/Q3BXCII5ABQ5G4BMD3NPFVDNFY/events.json","paper":"https://pith.science/paper/Q3BXCII5"},"agent_actions":{"view_html":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY","download_json":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY.json","view_paper":"https://pith.science/paper/Q3BXCII5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.1634&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3BXCII5ABQ5G4BMD3NPFVDNFY/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3BXCII5ABQ5G4BMD3NPFVDNFY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY/action/storage_attestation","attest_author":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY/action/author_attestation","sign_citation":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY/action/citation_signature","submit_replication":"https://pith.science/pith/Q3BXCII5ABQ5G4BMD3NPFVDNFY/action/replication_record"}},"created_at":"2026-05-18T03:52:28.693217+00:00","updated_at":"2026-05-18T03:52:28.693217+00:00"}