{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OFLWV3FOE4BQRZDTNLRJATLOPH","short_pith_number":"pith:OFLWV3FO","schema_version":"1.0","canonical_sha256":"71576aecae270308e4736ae2904d6e79fe8fa2dc3ddeb72cd2ed4d6237c7ddcb","source":{"kind":"arxiv","id":"1608.06170","version":1},"attestation_state":"computed","paper":{"title":"Tur\\'an problems for digraphs avoiding distinct walks of a given length with the same endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Zejun Huang, Zhenhua Lyu","submitted_at":"2016-08-22T14:05:28Z","abstract_excerpt":"Let $n \\ge 5$ and $k\\ge 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number when $k \\ge 5$."},"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":"1608.06170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-22T14:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"9f3d4e36587cdd4fae20eb15ea05dc445fce1097e25e8da43da636b7a744037b","abstract_canon_sha256":"bc14c60ceb5fc4e77464ebacfed96f3f0061691d65ebe080546e8893d13246b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.075586Z","signature_b64":"cGOosAwdv14B8Du1DhIjZ8xejRp4qtG0VJ4B/8/GGmmtxxyLdu4h0ZId8KBmUrPBSQZPzVe0FD+Ws/KHGyYbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71576aecae270308e4736ae2904d6e79fe8fa2dc3ddeb72cd2ed4d6237c7ddcb","last_reissued_at":"2026-05-18T01:08:22.075082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.075082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tur\\'an problems for digraphs avoiding distinct walks of a given length with the same endpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Zejun Huang, Zhenhua Lyu","submitted_at":"2016-08-22T14:05:28Z","abstract_excerpt":"Let $n \\ge 5$ and $k\\ge 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number when $k \\ge 5$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06170","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":"1608.06170","created_at":"2026-05-18T01:08:22.075159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06170v1","created_at":"2026-05-18T01:08:22.075159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06170","created_at":"2026-05-18T01:08:22.075159+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFLWV3FOE4BQ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFLWV3FOE4BQRZDT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFLWV3FO","created_at":"2026-05-18T12:30:36.002864+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/OFLWV3FOE4BQRZDTNLRJATLOPH","json":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH.json","graph_json":"https://pith.science/api/pith-number/OFLWV3FOE4BQRZDTNLRJATLOPH/graph.json","events_json":"https://pith.science/api/pith-number/OFLWV3FOE4BQRZDTNLRJATLOPH/events.json","paper":"https://pith.science/paper/OFLWV3FO"},"agent_actions":{"view_html":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH","download_json":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH.json","view_paper":"https://pith.science/paper/OFLWV3FO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06170&json=true","fetch_graph":"https://pith.science/api/pith-number/OFLWV3FOE4BQRZDTNLRJATLOPH/graph.json","fetch_events":"https://pith.science/api/pith-number/OFLWV3FOE4BQRZDTNLRJATLOPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH/action/storage_attestation","attest_author":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH/action/author_attestation","sign_citation":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH/action/citation_signature","submit_replication":"https://pith.science/pith/OFLWV3FOE4BQRZDTNLRJATLOPH/action/replication_record"}},"created_at":"2026-05-18T01:08:22.075159+00:00","updated_at":"2026-05-18T01:08:22.075159+00:00"}