{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2ROK2WO2FHWV5GYVANH7Y6R5SW","short_pith_number":"pith:2ROK2WO2","schema_version":"1.0","canonical_sha256":"d45cad59da29ed5e9b15034ffc7a3d95bf9a0973bd7033cace84b7202bd1da49","source":{"kind":"arxiv","id":"1609.04962","version":3},"attestation_state":"computed","paper":{"title":"Quasi-thin weakly distance-regular digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Yuefeng Yang","submitted_at":"2016-09-16T09:24:19Z","abstract_excerpt":"A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined."},"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":"1609.04962","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-16T09:24:19Z","cross_cats_sorted":[],"title_canon_sha256":"d75c5ada516b40dcee6bce800d1acf00efda853651a0350a99f9e7c8349b8b31","abstract_canon_sha256":"9bb1c2b3dd1ad80638c951048e1a9111cfd4d8e2cda9f4da18507516189c7087"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:37.709720Z","signature_b64":"khBL+o7h2uYgzI5QMCCrVWOBC0jsOcBNRxd6aiwYCPegRF+XHw6XJjMcsZb5mQ/IGObQ0s0XTo3aCZNllQkjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d45cad59da29ed5e9b15034ffc7a3d95bf9a0973bd7033cace84b7202bd1da49","last_reissued_at":"2026-05-18T00:04:37.709275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:37.709275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-thin weakly distance-regular digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Yuefeng Yang","submitted_at":"2016-09-16T09:24:19Z","abstract_excerpt":"A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04962","kind":"arxiv","version":3},"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":"1609.04962","created_at":"2026-05-18T00:04:37.709356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04962v3","created_at":"2026-05-18T00:04:37.709356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04962","created_at":"2026-05-18T00:04:37.709356+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ROK2WO2FHWV","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ROK2WO2FHWV5GYV","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ROK2WO2","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/2ROK2WO2FHWV5GYVANH7Y6R5SW","json":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW.json","graph_json":"https://pith.science/api/pith-number/2ROK2WO2FHWV5GYVANH7Y6R5SW/graph.json","events_json":"https://pith.science/api/pith-number/2ROK2WO2FHWV5GYVANH7Y6R5SW/events.json","paper":"https://pith.science/paper/2ROK2WO2"},"agent_actions":{"view_html":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW","download_json":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW.json","view_paper":"https://pith.science/paper/2ROK2WO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04962&json=true","fetch_graph":"https://pith.science/api/pith-number/2ROK2WO2FHWV5GYVANH7Y6R5SW/graph.json","fetch_events":"https://pith.science/api/pith-number/2ROK2WO2FHWV5GYVANH7Y6R5SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW/action/storage_attestation","attest_author":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW/action/author_attestation","sign_citation":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW/action/citation_signature","submit_replication":"https://pith.science/pith/2ROK2WO2FHWV5GYVANH7Y6R5SW/action/replication_record"}},"created_at":"2026-05-18T00:04:37.709356+00:00","updated_at":"2026-05-18T00:04:37.709356+00:00"}