{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3SBW2UL6SXOIV4W2GPJ2LCCHDH","short_pith_number":"pith:3SBW2UL6","schema_version":"1.0","canonical_sha256":"dc836d517e95dc8af2da33d3a5884719e257df0168c688e32baba30d77cf8451","source":{"kind":"arxiv","id":"1707.09437","version":1},"attestation_state":"computed","paper":{"title":"Tetravalent Vertex- and Edge-Transitive Graphs Over Doubled Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksander Malni\\v{c}, Bo\\v{s}tjan Kuzman, Primo\\v{z} Poto\\v{c}nik","submitted_at":"2017-07-28T23:31:34Z","abstract_excerpt":"In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In particular, the vertex- and edge-transitive graphs whose quotient by a normal $p$-elementary abelian group of automorphisms, for $p$ an odd prime, is a cycle, are described in terms of cyclic and negacyclic codes. Specifically, the symmetry properties of such graphs are derived from certain properties of the generating polynomials of cyclic and negacyclic code"},"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":"1707.09437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-28T23:31:34Z","cross_cats_sorted":[],"title_canon_sha256":"d3bb77ebf5cbb6312734058059c39fa6b119481e2d9e70ce34a05088a2c26ceb","abstract_canon_sha256":"34c6f0fd0bcaae96feac39dfa592bea47e3d8e5a720bb989ab8ad69f7638dacd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:11.267513Z","signature_b64":"8U6Rdxgq9tcRr3PbfxwcfzuuiqfQFIO3FKQMRdpeq5H8O9n0mSJ7ihzTVISI8W+8r0uXBDny9gEhRuArUswACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc836d517e95dc8af2da33d3a5884719e257df0168c688e32baba30d77cf8451","last_reissued_at":"2026-05-18T00:39:11.266916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:11.266916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tetravalent Vertex- and Edge-Transitive Graphs Over Doubled Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksander Malni\\v{c}, Bo\\v{s}tjan Kuzman, Primo\\v{z} Poto\\v{c}nik","submitted_at":"2017-07-28T23:31:34Z","abstract_excerpt":"In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In particular, the vertex- and edge-transitive graphs whose quotient by a normal $p$-elementary abelian group of automorphisms, for $p$ an odd prime, is a cycle, are described in terms of cyclic and negacyclic codes. Specifically, the symmetry properties of such graphs are derived from certain properties of the generating polynomials of cyclic and negacyclic code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09437","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":"1707.09437","created_at":"2026-05-18T00:39:11.267012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09437v1","created_at":"2026-05-18T00:39:11.267012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09437","created_at":"2026-05-18T00:39:11.267012+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SBW2UL6SXOI","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SBW2UL6SXOIV4W2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SBW2UL6","created_at":"2026-05-18T12:30:58.224056+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/3SBW2UL6SXOIV4W2GPJ2LCCHDH","json":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH.json","graph_json":"https://pith.science/api/pith-number/3SBW2UL6SXOIV4W2GPJ2LCCHDH/graph.json","events_json":"https://pith.science/api/pith-number/3SBW2UL6SXOIV4W2GPJ2LCCHDH/events.json","paper":"https://pith.science/paper/3SBW2UL6"},"agent_actions":{"view_html":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH","download_json":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH.json","view_paper":"https://pith.science/paper/3SBW2UL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09437&json=true","fetch_graph":"https://pith.science/api/pith-number/3SBW2UL6SXOIV4W2GPJ2LCCHDH/graph.json","fetch_events":"https://pith.science/api/pith-number/3SBW2UL6SXOIV4W2GPJ2LCCHDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH/action/storage_attestation","attest_author":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH/action/author_attestation","sign_citation":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH/action/citation_signature","submit_replication":"https://pith.science/pith/3SBW2UL6SXOIV4W2GPJ2LCCHDH/action/replication_record"}},"created_at":"2026-05-18T00:39:11.267012+00:00","updated_at":"2026-05-18T00:39:11.267012+00:00"}