{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2FDKP5JSVGGRPXWMR56PGEYZGP","short_pith_number":"pith:2FDKP5JS","schema_version":"1.0","canonical_sha256":"d146a7f532a98d17decc8f7cf3131933e18b4708cef98491e665e4b949c0350e","source":{"kind":"arxiv","id":"1808.05319","version":1},"attestation_state":"computed","paper":{"title":"Edge-transitive graphs of small order and the answer to a 1967 question by Folkman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Marston Conder","submitted_at":"2018-08-16T01:41:44Z","abstract_excerpt":"In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive graphs of order up to $47$, and all bipartite edge-transitive graphs of order up to $63$. We also give an answer to a 1967 question of Folkman about semi-symmetric graphs of large valency; in fact we show that for semi-symmetric graphs of order $2n$ and valency $d$, the ratio $d/n$ can be arbitrarily close to $1$."},"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":"1808.05319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-16T01:41:44Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"38bee9a6d8c9f52c758822cde45663b46ccb569c7f29c67ceb7aec609475120c","abstract_canon_sha256":"601c5e0a2ea8f8f316a9f996d91340798bdccb108c8ac32b1b7ae5a078526409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:57.565964Z","signature_b64":"Sr8xtcjTLKpv66stWPOV/mfX5gmZh/tbgXcyaHRazi2mV2tDaLgI0Bnn+ptBbjIqctmxVVHvhOD6XXI9Z7dBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d146a7f532a98d17decc8f7cf3131933e18b4708cef98491e665e4b949c0350e","last_reissued_at":"2026-05-18T00:07:57.565255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:57.565255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-transitive graphs of small order and the answer to a 1967 question by Folkman","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Marston Conder","submitted_at":"2018-08-16T01:41:44Z","abstract_excerpt":"In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive graphs of order up to $47$, and all bipartite edge-transitive graphs of order up to $63$. We also give an answer to a 1967 question of Folkman about semi-symmetric graphs of large valency; in fact we show that for semi-symmetric graphs of order $2n$ and valency $d$, the ratio $d/n$ can be arbitrarily close to $1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05319","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":"1808.05319","created_at":"2026-05-18T00:07:57.565383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05319v1","created_at":"2026-05-18T00:07:57.565383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05319","created_at":"2026-05-18T00:07:57.565383+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FDKP5JSVGGR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FDKP5JSVGGRPXWM","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FDKP5JS","created_at":"2026-05-18T12:32:02.567920+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/2FDKP5JSVGGRPXWMR56PGEYZGP","json":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP.json","graph_json":"https://pith.science/api/pith-number/2FDKP5JSVGGRPXWMR56PGEYZGP/graph.json","events_json":"https://pith.science/api/pith-number/2FDKP5JSVGGRPXWMR56PGEYZGP/events.json","paper":"https://pith.science/paper/2FDKP5JS"},"agent_actions":{"view_html":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP","download_json":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP.json","view_paper":"https://pith.science/paper/2FDKP5JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05319&json=true","fetch_graph":"https://pith.science/api/pith-number/2FDKP5JSVGGRPXWMR56PGEYZGP/graph.json","fetch_events":"https://pith.science/api/pith-number/2FDKP5JSVGGRPXWMR56PGEYZGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP/action/storage_attestation","attest_author":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP/action/author_attestation","sign_citation":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP/action/citation_signature","submit_replication":"https://pith.science/pith/2FDKP5JSVGGRPXWMR56PGEYZGP/action/replication_record"}},"created_at":"2026-05-18T00:07:57.565383+00:00","updated_at":"2026-05-18T00:07:57.565383+00:00"}