{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L3ELUOI3NW5GNFMNGDFUVW6K65","short_pith_number":"pith:L3ELUOI3","schema_version":"1.0","canonical_sha256":"5ec8ba391b6dba66958d30cb4adbcaf778264b2afabf23594d28c6db9a334802","source":{"kind":"arxiv","id":"1810.09954","version":1},"attestation_state":"computed","paper":{"title":"Sharply $k$-arc-transitive-digraphs: finite and infinite examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) University of Ljubljana, (3) Montanuniversit\\\"at Leoben, Austria), Iceland, Ljubljana, Norbert Seifter (3) ((1) University of Iceland, Primo\\v{z} Poto\\v{c}nik (2), Reykjav\\'ik, R\\\"ognvaldur G. M\\\"oller (1), Slovenia","submitted_at":"2018-10-23T16:36:09Z","abstract_excerpt":"A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth."},"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":"1810.09954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-23T16:36:09Z","cross_cats_sorted":[],"title_canon_sha256":"5fab429b6cb7d8917366d49297119659360c02fd08ce0fde50e7f3df88f9c221","abstract_canon_sha256":"57c0ddaee038924909207332e32fb9393889387ff96563139f4e2a7710dc0c0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:28.824436Z","signature_b64":"IOrOzfJeDVkBJ58izi+/5x84Cf6LIkmVr/kB2akGrtS9krVW5TsD2ndLBCsPM5dKNm7anoVIsC9jm4AT7YmIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ec8ba391b6dba66958d30cb4adbcaf778264b2afabf23594d28c6db9a334802","last_reissued_at":"2026-05-18T00:02:28.823814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:28.823814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharply $k$-arc-transitive-digraphs: finite and infinite examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"(2) University of Ljubljana, (3) Montanuniversit\\\"at Leoben, Austria), Iceland, Ljubljana, Norbert Seifter (3) ((1) University of Iceland, Primo\\v{z} Poto\\v{c}nik (2), Reykjav\\'ik, R\\\"ognvaldur G. M\\\"oller (1), Slovenia","submitted_at":"2018-10-23T16:36:09Z","abstract_excerpt":"A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09954","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":"1810.09954","created_at":"2026-05-18T00:02:28.823895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09954v1","created_at":"2026-05-18T00:02:28.823895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09954","created_at":"2026-05-18T00:02:28.823895+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3ELUOI3NW5G","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3ELUOI3NW5GNFMN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3ELUOI3","created_at":"2026-05-18T12:32:33.847187+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/L3ELUOI3NW5GNFMNGDFUVW6K65","json":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65.json","graph_json":"https://pith.science/api/pith-number/L3ELUOI3NW5GNFMNGDFUVW6K65/graph.json","events_json":"https://pith.science/api/pith-number/L3ELUOI3NW5GNFMNGDFUVW6K65/events.json","paper":"https://pith.science/paper/L3ELUOI3"},"agent_actions":{"view_html":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65","download_json":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65.json","view_paper":"https://pith.science/paper/L3ELUOI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09954&json=true","fetch_graph":"https://pith.science/api/pith-number/L3ELUOI3NW5GNFMNGDFUVW6K65/graph.json","fetch_events":"https://pith.science/api/pith-number/L3ELUOI3NW5GNFMNGDFUVW6K65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65/action/storage_attestation","attest_author":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65/action/author_attestation","sign_citation":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65/action/citation_signature","submit_replication":"https://pith.science/pith/L3ELUOI3NW5GNFMNGDFUVW6K65/action/replication_record"}},"created_at":"2026-05-18T00:02:28.823895+00:00","updated_at":"2026-05-18T00:02:28.823895+00:00"}