{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KC45EM6URS2K7Z4U6AM7XUWKH4","short_pith_number":"pith:KC45EM6U","schema_version":"1.0","canonical_sha256":"50b9d233d48cb4afe794f019fbd2ca3f3729886855a9292f3fbba659e1f76b46","source":{"kind":"arxiv","id":"1509.05221","version":1},"attestation_state":"computed","paper":{"title":"Cayley numbers with arbitrarily many distinct prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Edward Dobson, Pablo Spiga","submitted_at":"2015-09-17T12:01:44Z","abstract_excerpt":"A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\\v{s}i\\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of primes such that every finite product of distinct elements from $S$ is a Cayley number. This answers a 1996 outstanding question of Brendan McKay and Cheryl Praeger, which they \"believe to be the key unresolved question\" on Cayley numbers.\n  We also show that, for every finite product $n$ of distinct elements from $S$, every transitive group of degree $n$ conta"},"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":"1509.05221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-17T12:01:44Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"6201d37a9681e99f2d20527a9d5acb5a6ff70a0c8753c9fb5524ce8e1ecedb5d","abstract_canon_sha256":"293cbe92108eb87ac713ab563e79f668b781ede4fae657b87017c904e2e49831"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:49.582341Z","signature_b64":"kIYs18yUV19xIKYjTww6D/5PFQPmv9rNHBLELdbJLOUz0ynDCEmyx6E3Ln3l2yNSdfk1XmDUmrOnSkzbce50BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50b9d233d48cb4afe794f019fbd2ca3f3729886855a9292f3fbba659e1f76b46","last_reissued_at":"2026-05-18T01:32:49.581659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:49.581659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cayley numbers with arbitrarily many distinct prime factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Edward Dobson, Pablo Spiga","submitted_at":"2015-09-17T12:01:44Z","abstract_excerpt":"A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\\v{s}i\\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of primes such that every finite product of distinct elements from $S$ is a Cayley number. This answers a 1996 outstanding question of Brendan McKay and Cheryl Praeger, which they \"believe to be the key unresolved question\" on Cayley numbers.\n  We also show that, for every finite product $n$ of distinct elements from $S$, every transitive group of degree $n$ conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05221","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":"1509.05221","created_at":"2026-05-18T01:32:49.581750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05221v1","created_at":"2026-05-18T01:32:49.581750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05221","created_at":"2026-05-18T01:32:49.581750+00:00"},{"alias_kind":"pith_short_12","alias_value":"KC45EM6URS2K","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KC45EM6URS2K7Z4U","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KC45EM6U","created_at":"2026-05-18T12:29:27.538025+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/KC45EM6URS2K7Z4U6AM7XUWKH4","json":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4.json","graph_json":"https://pith.science/api/pith-number/KC45EM6URS2K7Z4U6AM7XUWKH4/graph.json","events_json":"https://pith.science/api/pith-number/KC45EM6URS2K7Z4U6AM7XUWKH4/events.json","paper":"https://pith.science/paper/KC45EM6U"},"agent_actions":{"view_html":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4","download_json":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4.json","view_paper":"https://pith.science/paper/KC45EM6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05221&json=true","fetch_graph":"https://pith.science/api/pith-number/KC45EM6URS2K7Z4U6AM7XUWKH4/graph.json","fetch_events":"https://pith.science/api/pith-number/KC45EM6URS2K7Z4U6AM7XUWKH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4/action/storage_attestation","attest_author":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4/action/author_attestation","sign_citation":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4/action/citation_signature","submit_replication":"https://pith.science/pith/KC45EM6URS2K7Z4U6AM7XUWKH4/action/replication_record"}},"created_at":"2026-05-18T01:32:49.581750+00:00","updated_at":"2026-05-18T01:32:49.581750+00:00"}