{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UEKYUIQOXG4HFWI5RIKZ6N3KTJ","short_pith_number":"pith:UEKYUIQO","schema_version":"1.0","canonical_sha256":"a1158a220eb9b872d91d8a159f376a9a6d54725cf65cc16d4045cd94b7de9139","source":{"kind":"arxiv","id":"1201.5317","version":1},"attestation_state":"computed","paper":{"title":"Cubic vertex-transitive graphs on up to 1280 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Pablo Spiga, Primoz Potocnik","submitted_at":"2012-01-25T16:22:20Z","abstract_excerpt":"A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arc- set, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. In the process, we also construct all tetravalent arc-transitive graphs of order at most 640."},"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":"1201.5317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-25T16:22:20Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"b65eca6adf3f4c4f7d33aa24e4cf021420baaa8493c2047430994c8bfe21ebf0","abstract_canon_sha256":"abb90da96c11108308ea8a8a376a8dea24350e3a3953adde2cb1c369c6aff073"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:55.064158Z","signature_b64":"tcSQl+lMdF2U8xL5uKf2wCuLaXDp8u+oTxVwP+PJ+LPeu3wOWV8aOX+enRxTl7LvYpM+RQzDqqcBMR7PA21wAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1158a220eb9b872d91d8a159f376a9a6d54725cf65cc16d4045cd94b7de9139","last_reissued_at":"2026-05-18T04:03:55.063459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:55.063459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic vertex-transitive graphs on up to 1280 vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Gabriel Verret, Pablo Spiga, Primoz Potocnik","submitted_at":"2012-01-25T16:22:20Z","abstract_excerpt":"A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arc- set, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. In the process, we also construct all tetravalent arc-transitive graphs of order at most 640."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5317","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":"1201.5317","created_at":"2026-05-18T04:03:55.063581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5317v1","created_at":"2026-05-18T04:03:55.063581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5317","created_at":"2026-05-18T04:03:55.063581+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEKYUIQOXG4H","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEKYUIQOXG4HFWI5","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEKYUIQO","created_at":"2026-05-18T12:27:23.164592+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/UEKYUIQOXG4HFWI5RIKZ6N3KTJ","json":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ.json","graph_json":"https://pith.science/api/pith-number/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/graph.json","events_json":"https://pith.science/api/pith-number/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/events.json","paper":"https://pith.science/paper/UEKYUIQO"},"agent_actions":{"view_html":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ","download_json":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ.json","view_paper":"https://pith.science/paper/UEKYUIQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5317&json=true","fetch_graph":"https://pith.science/api/pith-number/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/action/storage_attestation","attest_author":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/action/author_attestation","sign_citation":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/action/citation_signature","submit_replication":"https://pith.science/pith/UEKYUIQOXG4HFWI5RIKZ6N3KTJ/action/replication_record"}},"created_at":"2026-05-18T04:03:55.063581+00:00","updated_at":"2026-05-18T04:03:55.063581+00:00"}