{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EZ7NVEMUGVE44AKS6DMDT3QWEM","short_pith_number":"pith:EZ7NVEMU","schema_version":"1.0","canonical_sha256":"267eda91943549ce0152f0d839ee16231c9e0e73d70e6355886f1cc04573f9d6","source":{"kind":"arxiv","id":"2102.05432","version":1},"attestation_state":"computed","paper":{"title":"On strongly regular graph with parameters (65; 32; 15; 16)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Gritsenko","submitted_at":"2021-02-10T13:53:43Z","abstract_excerpt":"We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials matrices of smaller orders. We can consider these congruences over different moduli for a more efficient computational approach."},"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":"2102.05432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-02-10T13:53:43Z","cross_cats_sorted":[],"title_canon_sha256":"63d6f4faec3cd68bf08a955452b95d3c4a3f9a43a1cf342a2509b779f16772cb","abstract_canon_sha256":"afc03a05b83776b54bf86eb2834fa5f1b4a50e14c813e571a4134d443f6c7c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:18.577537Z","signature_b64":"EAuD8F1+O049lDFyz+XWGvq+6psfKqPubcRlpY4xnQWRoksdxPtK/lUu4xoQalQilnkHAOCFoA+TpAPz48KBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267eda91943549ce0152f0d839ee16231c9e0e73d70e6355886f1cc04573f9d6","last_reissued_at":"2026-07-05T02:14:18.577040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:18.577040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On strongly regular graph with parameters (65; 32; 15; 16)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Gritsenko","submitted_at":"2021-02-10T13:53:43Z","abstract_excerpt":"We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials matrices of smaller orders. We can consider these congruences over different moduli for a more efficient computational approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.05432","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.05432/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.05432","created_at":"2026-07-05T02:14:18.577099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.05432v1","created_at":"2026-07-05T02:14:18.577099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.05432","created_at":"2026-07-05T02:14:18.577099+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ7NVEMUGVE4","created_at":"2026-07-05T02:14:18.577099+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ7NVEMUGVE44AKS","created_at":"2026-07-05T02:14:18.577099+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ7NVEMU","created_at":"2026-07-05T02:14:18.577099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23936","citing_title":"Fuzzy, Neutrosophic, and Uncertain Graph Theory: Properties and Applications","ref_index":263,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23037","citing_title":"Approaching the Conway-99 problem using SAT solvers","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM","json":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM.json","graph_json":"https://pith.science/api/pith-number/EZ7NVEMUGVE44AKS6DMDT3QWEM/graph.json","events_json":"https://pith.science/api/pith-number/EZ7NVEMUGVE44AKS6DMDT3QWEM/events.json","paper":"https://pith.science/paper/EZ7NVEMU"},"agent_actions":{"view_html":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM","download_json":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM.json","view_paper":"https://pith.science/paper/EZ7NVEMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.05432&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ7NVEMUGVE44AKS6DMDT3QWEM/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ7NVEMUGVE44AKS6DMDT3QWEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM/action/storage_attestation","attest_author":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM/action/author_attestation","sign_citation":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM/action/citation_signature","submit_replication":"https://pith.science/pith/EZ7NVEMUGVE44AKS6DMDT3QWEM/action/replication_record"}},"created_at":"2026-07-05T02:14:18.577099+00:00","updated_at":"2026-07-05T02:14:18.577099+00:00"}