{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7SOVR5YAL5TDNAQEAAZHAWVCA7","short_pith_number":"pith:7SOVR5YA","schema_version":"1.0","canonical_sha256":"fc9d58f7005f663682040032705aa207c11762656ab2a7458842cf87890704cd","source":{"kind":"arxiv","id":"1201.2260","version":1},"attestation_state":"computed","paper":{"title":"The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini","submitted_at":"2012-01-11T08:31:10Z","abstract_excerpt":"In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial classification of the extremal size of complete (n,3)-arcs in PG(2,16)."},"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":"1201.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-11T08:31:10Z","cross_cats_sorted":[],"title_canon_sha256":"ef95dd7ecba53fe41aa3ddb3e27af00cc67242ad6738b50a4348f3f79da6d93f","abstract_canon_sha256":"2247650abb02bf08e846adc1248e3b417ee3188a9898e1691be8eeb39e2730d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:52.747604Z","signature_b64":"vhKJzWjtY8spPr+WgrB3+DrjpiGTHitRpIx5OZ3nCc7kmti5B1XlQskJX9yg/NKgUF5AS8ZsMiJx5t/Bdp11DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc9d58f7005f663682040032705aa207c11762656ab2a7458842cf87890704cd","last_reissued_at":"2026-05-18T04:04:52.746901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:52.746901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Fernanda Pambianco, Stefano Marcugini","submitted_at":"2012-01-11T08:31:10Z","abstract_excerpt":"In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial classification of the extremal size of complete (n,3)-arcs in PG(2,16)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2260","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":"1201.2260","created_at":"2026-05-18T04:04:52.747004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2260v1","created_at":"2026-05-18T04:04:52.747004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2260","created_at":"2026-05-18T04:04:52.747004+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SOVR5YAL5TD","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SOVR5YAL5TDNAQE","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SOVR5YA","created_at":"2026-05-18T12:26:58.693483+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/7SOVR5YAL5TDNAQEAAZHAWVCA7","json":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7.json","graph_json":"https://pith.science/api/pith-number/7SOVR5YAL5TDNAQEAAZHAWVCA7/graph.json","events_json":"https://pith.science/api/pith-number/7SOVR5YAL5TDNAQEAAZHAWVCA7/events.json","paper":"https://pith.science/paper/7SOVR5YA"},"agent_actions":{"view_html":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7","download_json":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7.json","view_paper":"https://pith.science/paper/7SOVR5YA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2260&json=true","fetch_graph":"https://pith.science/api/pith-number/7SOVR5YAL5TDNAQEAAZHAWVCA7/graph.json","fetch_events":"https://pith.science/api/pith-number/7SOVR5YAL5TDNAQEAAZHAWVCA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7/action/storage_attestation","attest_author":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7/action/author_attestation","sign_citation":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7/action/citation_signature","submit_replication":"https://pith.science/pith/7SOVR5YAL5TDNAQEAAZHAWVCA7/action/replication_record"}},"created_at":"2026-05-18T04:04:52.747004+00:00","updated_at":"2026-05-18T04:04:52.747004+00:00"}