{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:MUZYAGFSSV7ZFUR6LRAJSPOMBA","short_pith_number":"pith:MUZYAGFS","schema_version":"1.0","canonical_sha256":"65338018b2957f92d23e5c40993dcc083376d8ec0c592000d1fa8e84162bab0d","source":{"kind":"arxiv","id":"0906.5389","version":1},"attestation_state":"computed","paper":{"title":"Comparison of two techniques for proving nonexistence of strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vasek Chvatal","submitted_at":"2009-06-30T00:35:06Z","abstract_excerpt":"We show that the method of counting closed walks in strongly regular graphs rules out no parameter sets other than those ruled out by the method of counting eigenvalue multiplicities."},"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":"0906.5389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-30T00:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"569391fcad94c0ab2dbaa414f0b971dc01a75c805a8d4fb493796edb0c8dd5b5","abstract_canon_sha256":"030381bbd82428d43f45900102971d850230f3a4ecb8e55a1482b012ec0c1cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.002399Z","signature_b64":"RvC102c7pa1tix8KDMhPV+oYbyAL5pF1oYZE+NUnNkS20PEwtJe9stgFSZJ74/z2Hwd6/DSBF6kgf7dCGQdqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65338018b2957f92d23e5c40993dcc083376d8ec0c592000d1fa8e84162bab0d","last_reissued_at":"2026-05-18T03:56:23.001858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.001858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison of two techniques for proving nonexistence of strongly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vasek Chvatal","submitted_at":"2009-06-30T00:35:06Z","abstract_excerpt":"We show that the method of counting closed walks in strongly regular graphs rules out no parameter sets other than those ruled out by the method of counting eigenvalue multiplicities."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5389","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":"0906.5389","created_at":"2026-05-18T03:56:23.001932+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.5389v1","created_at":"2026-05-18T03:56:23.001932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.5389","created_at":"2026-05-18T03:56:23.001932+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUZYAGFSSV7Z","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUZYAGFSSV7ZFUR6","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUZYAGFS","created_at":"2026-05-18T12:26:00.592388+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/MUZYAGFSSV7ZFUR6LRAJSPOMBA","json":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA.json","graph_json":"https://pith.science/api/pith-number/MUZYAGFSSV7ZFUR6LRAJSPOMBA/graph.json","events_json":"https://pith.science/api/pith-number/MUZYAGFSSV7ZFUR6LRAJSPOMBA/events.json","paper":"https://pith.science/paper/MUZYAGFS"},"agent_actions":{"view_html":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA","download_json":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA.json","view_paper":"https://pith.science/paper/MUZYAGFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.5389&json=true","fetch_graph":"https://pith.science/api/pith-number/MUZYAGFSSV7ZFUR6LRAJSPOMBA/graph.json","fetch_events":"https://pith.science/api/pith-number/MUZYAGFSSV7ZFUR6LRAJSPOMBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA/action/storage_attestation","attest_author":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA/action/author_attestation","sign_citation":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA/action/citation_signature","submit_replication":"https://pith.science/pith/MUZYAGFSSV7ZFUR6LRAJSPOMBA/action/replication_record"}},"created_at":"2026-05-18T03:56:23.001932+00:00","updated_at":"2026-05-18T03:56:23.001932+00:00"}