{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3DEPYLDSQ5CDSH42WEOKOQVIQ3","short_pith_number":"pith:3DEPYLDS","schema_version":"1.0","canonical_sha256":"d8c8fc2c728744391f9ab11ca742a886e3fd562292080a94ff4565eedc8d5979","source":{"kind":"arxiv","id":"1607.02618","version":1},"attestation_state":"computed","paper":{"title":"On cubic symmetric non-Cayley graphs with solvable automorphism groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Da-Wei Yang, Dragan Marusic, Klavdija Kutnar, Yan-Quan Feng","submitted_at":"2016-07-09T14:46:04Z","abstract_excerpt":"It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\\em European J. Combin.} {\\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a Cayley graph or a $2$-regular graph of type $2^2$, that is, a graph with no automorphism of order $2$ interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic $2$-regular graphs of type $2^2$ with a solvable automorphism group is constructed. The smallest graph in this family has order 6174."},"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":"1607.02618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-09T14:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"94d1ef79175ca0c82faa65831ad9957da4a13597b9bc8c705bb0dc5972b5d0ed","abstract_canon_sha256":"0eab9ca1a144a3fda65e4520f77a51d5df546af8ceaa4d5b537263102e0ad780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:16.641819Z","signature_b64":"ARMyED33KpP9MxE0FD7FpbRpNnBYioqRI4Isb//uUtsvG93+GiDWSUylsi2L9jm4Y9gIA6VW8ocoFCDL30R+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c8fc2c728744391f9ab11ca742a886e3fd562292080a94ff4565eedc8d5979","last_reissued_at":"2026-05-18T01:11:16.641271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:16.641271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cubic symmetric non-Cayley graphs with solvable automorphism groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Da-Wei Yang, Dragan Marusic, Klavdija Kutnar, Yan-Quan Feng","submitted_at":"2016-07-09T14:46:04Z","abstract_excerpt":"It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\\em European J. Combin.} {\\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a Cayley graph or a $2$-regular graph of type $2^2$, that is, a graph with no automorphism of order $2$ interchanging two adjacent vertices. In this paper an infinite family of non-Cayley cubic $2$-regular graphs of type $2^2$ with a solvable automorphism group is constructed. The smallest graph in this family has order 6174."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02618","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":"1607.02618","created_at":"2026-05-18T01:11:16.641399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02618v1","created_at":"2026-05-18T01:11:16.641399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02618","created_at":"2026-05-18T01:11:16.641399+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DEPYLDSQ5CD","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DEPYLDSQ5CDSH42","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DEPYLDS","created_at":"2026-05-18T12:29:55.572404+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/3DEPYLDSQ5CDSH42WEOKOQVIQ3","json":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3.json","graph_json":"https://pith.science/api/pith-number/3DEPYLDSQ5CDSH42WEOKOQVIQ3/graph.json","events_json":"https://pith.science/api/pith-number/3DEPYLDSQ5CDSH42WEOKOQVIQ3/events.json","paper":"https://pith.science/paper/3DEPYLDS"},"agent_actions":{"view_html":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3","download_json":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3.json","view_paper":"https://pith.science/paper/3DEPYLDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02618&json=true","fetch_graph":"https://pith.science/api/pith-number/3DEPYLDSQ5CDSH42WEOKOQVIQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/3DEPYLDSQ5CDSH42WEOKOQVIQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3/action/storage_attestation","attest_author":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3/action/author_attestation","sign_citation":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3/action/citation_signature","submit_replication":"https://pith.science/pith/3DEPYLDSQ5CDSH42WEOKOQVIQ3/action/replication_record"}},"created_at":"2026-05-18T01:11:16.641399+00:00","updated_at":"2026-05-18T01:11:16.641399+00:00"}