{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M3KQ6UTWWMQ5NVP5VUAIFMFXVH","short_pith_number":"pith:M3KQ6UTW","schema_version":"1.0","canonical_sha256":"66d50f5276b321d6d5fdad0082b0b7a9ee59ce2aa201f2b53397f40bd58af6a4","source":{"kind":"arxiv","id":"1205.6948","version":1},"attestation_state":"computed","paper":{"title":"On distance-regular Cayley graphs on abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2012-05-31T10:22:18Z","abstract_excerpt":"Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \\setminus {1}$, which generates $G$ and for which there exists $s \\in S$, such that $\\la S \\setminus \\{s,s^{-1}\\} \\ra \\ne G$. In this paper we obtain the complete classification of distance-regular Cayley graphs $\\cay(G;S)$ for such pairs of $G$ and $S$."},"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":"1205.6948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-31T10:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"9a63430db5e8ac041dddf87c35ebfcc3dc0c09c7dfd4c6f30f91ab6472dd0686","abstract_canon_sha256":"5915e6e6425e11a3916fcad91d6a0fe39b9a89686ba9105da166e64dac56e0c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:36.538392Z","signature_b64":"Gp6Jo3Pw1nDca7Hpeegn9qGgO9iHJw6TnkEP/e3tYrfS9nFs4V9mpCOImkZXbm7/QMKWhhmqH6PxUrxWEF7bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d50f5276b321d6d5fdad0082b0b7a9ee59ce2aa201f2b53397f40bd58af6a4","last_reissued_at":"2026-05-18T03:54:36.537755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:36.537755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On distance-regular Cayley graphs on abelian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2012-05-31T10:22:18Z","abstract_excerpt":"Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \\setminus {1}$, which generates $G$ and for which there exists $s \\in S$, such that $\\la S \\setminus \\{s,s^{-1}\\} \\ra \\ne G$. In this paper we obtain the complete classification of distance-regular Cayley graphs $\\cay(G;S)$ for such pairs of $G$ and $S$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6948","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":"1205.6948","created_at":"2026-05-18T03:54:36.537850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6948v1","created_at":"2026-05-18T03:54:36.537850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6948","created_at":"2026-05-18T03:54:36.537850+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3KQ6UTWWMQ5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3KQ6UTWWMQ5NVP5","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3KQ6UTW","created_at":"2026-05-18T12:27:14.488303+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/M3KQ6UTWWMQ5NVP5VUAIFMFXVH","json":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH.json","graph_json":"https://pith.science/api/pith-number/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/graph.json","events_json":"https://pith.science/api/pith-number/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/events.json","paper":"https://pith.science/paper/M3KQ6UTW"},"agent_actions":{"view_html":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH","download_json":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH.json","view_paper":"https://pith.science/paper/M3KQ6UTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6948&json=true","fetch_graph":"https://pith.science/api/pith-number/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/graph.json","fetch_events":"https://pith.science/api/pith-number/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/action/storage_attestation","attest_author":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/action/author_attestation","sign_citation":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/action/citation_signature","submit_replication":"https://pith.science/pith/M3KQ6UTWWMQ5NVP5VUAIFMFXVH/action/replication_record"}},"created_at":"2026-05-18T03:54:36.537850+00:00","updated_at":"2026-05-18T03:54:36.537850+00:00"}