{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OVDSS3B2M2XU22IMZIXBEYGU26","short_pith_number":"pith:OVDSS3B2","schema_version":"1.0","canonical_sha256":"7547296c3a66af4d690cca2e1260d4d7a9b49bcafc95f1b507d5e8af6e01cf27","source":{"kind":"arxiv","id":"1601.00181","version":2},"attestation_state":"computed","paper":{"title":"Implementing Brouwer's database of strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Nathann Cohen","submitted_at":"2016-01-02T15:02:04Z","abstract_excerpt":"Andries Brouwer maintains a public database of existence results for strongly regular graphs on $n\\leq 1300$ vertices. We implemented most of the infinite families of graphs listed there in the open-source software Sagemath, as well as provided constructions of the \"sporadic\" cases, to obtain a graph for each set of parameters with known examples. Besides providing a convenient way to verify these existence results from the actual graphs, it also extends the database to higher values of $n$."},"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":"1601.00181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-02T15:02:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e64557071d93ca3f5af0f9c3d5ed6adbafaafb3f68009e7b947e08ec679afbc4","abstract_canon_sha256":"ca2e7d6a0bcd30d28d676fa8d61ad4a2e1688d64acb296fbe9f3414932b9053a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.287527Z","signature_b64":"q5pO9HSGQct1/U/ObcXqRezARj4uqeMfmpDG1OZr+AGYEyiTeNGxZGWqChptfXbotMXdS70/P70VZZkvwp6NCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7547296c3a66af4d690cca2e1260d4d7a9b49bcafc95f1b507d5e8af6e01cf27","last_reissued_at":"2026-05-18T00:41:02.286842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.286842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing Brouwer's database of strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Dmitrii V. Pasechnik, Nathann Cohen","submitted_at":"2016-01-02T15:02:04Z","abstract_excerpt":"Andries Brouwer maintains a public database of existence results for strongly regular graphs on $n\\leq 1300$ vertices. We implemented most of the infinite families of graphs listed there in the open-source software Sagemath, as well as provided constructions of the \"sporadic\" cases, to obtain a graph for each set of parameters with known examples. Besides providing a convenient way to verify these existence results from the actual graphs, it also extends the database to higher values of $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00181","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":"1601.00181","created_at":"2026-05-18T00:41:02.286984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00181v2","created_at":"2026-05-18T00:41:02.286984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00181","created_at":"2026-05-18T00:41:02.286984+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVDSS3B2M2XU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVDSS3B2M2XU22IM","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVDSS3B2","created_at":"2026-05-18T12:30:36.002864+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/OVDSS3B2M2XU22IMZIXBEYGU26","json":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26.json","graph_json":"https://pith.science/api/pith-number/OVDSS3B2M2XU22IMZIXBEYGU26/graph.json","events_json":"https://pith.science/api/pith-number/OVDSS3B2M2XU22IMZIXBEYGU26/events.json","paper":"https://pith.science/paper/OVDSS3B2"},"agent_actions":{"view_html":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26","download_json":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26.json","view_paper":"https://pith.science/paper/OVDSS3B2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00181&json=true","fetch_graph":"https://pith.science/api/pith-number/OVDSS3B2M2XU22IMZIXBEYGU26/graph.json","fetch_events":"https://pith.science/api/pith-number/OVDSS3B2M2XU22IMZIXBEYGU26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26/action/storage_attestation","attest_author":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26/action/author_attestation","sign_citation":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26/action/citation_signature","submit_replication":"https://pith.science/pith/OVDSS3B2M2XU22IMZIXBEYGU26/action/replication_record"}},"created_at":"2026-05-18T00:41:02.286984+00:00","updated_at":"2026-05-18T00:41:02.286984+00:00"}