{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JHBA3LFAILRKQJAFKCG5RRPVTZ","short_pith_number":"pith:JHBA3LFA","schema_version":"1.0","canonical_sha256":"49c20daca042e2a82405508dd8c5f59e4a5581918560f0c994a8b859cb2214b9","source":{"kind":"arxiv","id":"1405.1228","version":2},"attestation_state":"computed","paper":{"title":"Elusive groups of automorphisms of digraphs of small valency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Luke Morgan, Michael Giudici, Primo\\v{z} Poto\\v{c}nik","submitted_at":"2014-05-06T11:17:55Z","abstract_excerpt":"A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three."},"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":"1405.1228","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-06T11:17:55Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"a7e0ae4282630cde86987ebc2be173b84b0d2fcbd99862985c42b7e12a471c78","abstract_canon_sha256":"fd8f74f2d1d28088019f053fdbb3de1866648ddd943c08c14a36376277a84c77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:47.418228Z","signature_b64":"xT4oCTzDLNjlKlh0mq6XkD+xHwR3X9FQHiG/dd7zwDVjLG8fZ6jynFmYN2GdlmxvDwkt7PRxVP57ySSGiWP5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49c20daca042e2a82405508dd8c5f59e4a5581918560f0c994a8b859cb2214b9","last_reissued_at":"2026-05-18T02:31:47.417424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:47.417424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elusive groups of automorphisms of digraphs of small valency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Luke Morgan, Michael Giudici, Primo\\v{z} Poto\\v{c}nik","submitted_at":"2014-05-06T11:17:55Z","abstract_excerpt":"A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1228","kind":"arxiv","version":2},"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":"1405.1228","created_at":"2026-05-18T02:31:47.417553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1228v2","created_at":"2026-05-18T02:31:47.417553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1228","created_at":"2026-05-18T02:31:47.417553+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHBA3LFAILRK","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHBA3LFAILRKQJAF","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHBA3LFA","created_at":"2026-05-18T12:28:33.132498+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/JHBA3LFAILRKQJAFKCG5RRPVTZ","json":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ.json","graph_json":"https://pith.science/api/pith-number/JHBA3LFAILRKQJAFKCG5RRPVTZ/graph.json","events_json":"https://pith.science/api/pith-number/JHBA3LFAILRKQJAFKCG5RRPVTZ/events.json","paper":"https://pith.science/paper/JHBA3LFA"},"agent_actions":{"view_html":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ","download_json":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ.json","view_paper":"https://pith.science/paper/JHBA3LFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1228&json=true","fetch_graph":"https://pith.science/api/pith-number/JHBA3LFAILRKQJAFKCG5RRPVTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JHBA3LFAILRKQJAFKCG5RRPVTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ/action/storage_attestation","attest_author":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ/action/author_attestation","sign_citation":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ/action/citation_signature","submit_replication":"https://pith.science/pith/JHBA3LFAILRKQJAFKCG5RRPVTZ/action/replication_record"}},"created_at":"2026-05-18T02:31:47.417553+00:00","updated_at":"2026-05-18T02:31:47.417553+00:00"}