{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R3RBGDNXCWJHNZYIUFN24JNQOU","short_pith_number":"pith:R3RBGDNX","schema_version":"1.0","canonical_sha256":"8ee2130db7159276e708a15bae25b07519b9fae1b1155388c3f4bc72bfc1f1e6","source":{"kind":"arxiv","id":"1306.5443","version":1},"attestation_state":"computed","paper":{"title":"On Cayley digraphs that do not have hamiltonian paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dave Witte Morris","submitted_at":"2013-06-23T17:25:31Z","abstract_excerpt":"We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with |[G,G]| < 4, then every connected Cayley digraph on G has a hamiltonian path (but the conclusion does not always hold when |[G,G]| = 4 or 5)."},"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":"1306.5443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-23T17:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"06e3004b2edea22e5cfabff9b12babf750b78f4d4067a6527ce66370159869a7","abstract_canon_sha256":"62dfd1a987dfb0bfc2e0575c59109cd7e01cbbc22b840a260103de86390486e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:08.096151Z","signature_b64":"TN0JztXfFqLoS5vfJ/lO8zwW6GnXSf+5dmYQZ6lclVgNqffvIRnIOta0itvNmfdcJu6rzjvHTkGwx3qgoeqgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee2130db7159276e708a15bae25b07519b9fae1b1155388c3f4bc72bfc1f1e6","last_reissued_at":"2026-05-18T03:20:08.095354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:08.095354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Cayley digraphs that do not have hamiltonian paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dave Witte Morris","submitted_at":"2013-06-23T17:25:31Z","abstract_excerpt":"We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with |[G,G]| < 4, then every connected Cayley digraph on G has a hamiltonian path (but the conclusion does not always hold when |[G,G]| = 4 or 5)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5443","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":"1306.5443","created_at":"2026-05-18T03:20:08.095501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5443v1","created_at":"2026-05-18T03:20:08.095501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5443","created_at":"2026-05-18T03:20:08.095501+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3RBGDNXCWJH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3RBGDNXCWJHNZYI","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3RBGDNX","created_at":"2026-05-18T12:27:57.521954+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/R3RBGDNXCWJHNZYIUFN24JNQOU","json":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU.json","graph_json":"https://pith.science/api/pith-number/R3RBGDNXCWJHNZYIUFN24JNQOU/graph.json","events_json":"https://pith.science/api/pith-number/R3RBGDNXCWJHNZYIUFN24JNQOU/events.json","paper":"https://pith.science/paper/R3RBGDNX"},"agent_actions":{"view_html":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU","download_json":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU.json","view_paper":"https://pith.science/paper/R3RBGDNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5443&json=true","fetch_graph":"https://pith.science/api/pith-number/R3RBGDNXCWJHNZYIUFN24JNQOU/graph.json","fetch_events":"https://pith.science/api/pith-number/R3RBGDNXCWJHNZYIUFN24JNQOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU/action/storage_attestation","attest_author":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU/action/author_attestation","sign_citation":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU/action/citation_signature","submit_replication":"https://pith.science/pith/R3RBGDNXCWJHNZYIUFN24JNQOU/action/replication_record"}},"created_at":"2026-05-18T03:20:08.095501+00:00","updated_at":"2026-05-18T03:20:08.095501+00:00"}