{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QIUX6BGASDIWMHEBRDR2ZTEPMW","short_pith_number":"pith:QIUX6BGA","schema_version":"1.0","canonical_sha256":"82297f04c090d1661c8188e3accc8f658fe06aab528e2635860826a9afdc740f","source":{"kind":"arxiv","id":"2401.05205","version":1},"attestation_state":"computed","paper":{"title":"Long antipaths and anticycles in oriented graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Chen, Hongyu Zhou, Xinmin Hou","submitted_at":"2024-01-10T15:04:02Z","abstract_excerpt":"Let $\\delta^{0}(D)$ be the minimum semi-degree of an oriented graph $D$. Jackson (1981) proved that every oriented graph $D$ with $\\delta^{0}(D)\\geq k$ contains a directed path of length $2k$ when $|V(D)|>2k+2$, and a directed Hamilton cycle when $|V(D)|\\le 2k+2$. Stein~(2020) further conjectured that every oriented graph $D$ with $\\delta^{0}(D)>k/2$ contains any orientated path of length $k$. Recently, Klimo\\u{s}ov\\'{a} and Stein (DM, 2023) introduced the minimum pseudo-semi-degree $\\tilde\\delta^0(D)$ (a slight weaker than the minimum semi-degree condition as $\\tilde\\delta^0(D)\\ge \\delta^0(D)"},"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":"2401.05205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-10T15:04:02Z","cross_cats_sorted":[],"title_canon_sha256":"79b2be7f05ea15b90bc03b4bb4e5b0e4315c312e6b80cd4cfac3b4ef04256410","abstract_canon_sha256":"9b8673a505dde2995f3779610baf5a027865ed9526a83c1889d6c1df1f6558c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:12.103502Z","signature_b64":"FMLkdtayoyc1vQt4fc1DNwfrt/PUxTuEtyR5H3xMG26uHicDGEZJzxRFPYYg2caCNpmYHDiEvDoXe+QHlLWHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82297f04c090d1661c8188e3accc8f658fe06aab528e2635860826a9afdc740f","last_reissued_at":"2026-07-05T07:32:12.103099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:12.103099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long antipaths and anticycles in oriented graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Chen, Hongyu Zhou, Xinmin Hou","submitted_at":"2024-01-10T15:04:02Z","abstract_excerpt":"Let $\\delta^{0}(D)$ be the minimum semi-degree of an oriented graph $D$. Jackson (1981) proved that every oriented graph $D$ with $\\delta^{0}(D)\\geq k$ contains a directed path of length $2k$ when $|V(D)|>2k+2$, and a directed Hamilton cycle when $|V(D)|\\le 2k+2$. Stein~(2020) further conjectured that every oriented graph $D$ with $\\delta^{0}(D)>k/2$ contains any orientated path of length $k$. Recently, Klimo\\u{s}ov\\'{a} and Stein (DM, 2023) introduced the minimum pseudo-semi-degree $\\tilde\\delta^0(D)$ (a slight weaker than the minimum semi-degree condition as $\\tilde\\delta^0(D)\\ge \\delta^0(D)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.05205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.05205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.05205","created_at":"2026-07-05T07:32:12.103153+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.05205v1","created_at":"2026-07-05T07:32:12.103153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.05205","created_at":"2026-07-05T07:32:12.103153+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIUX6BGASDIW","created_at":"2026-07-05T07:32:12.103153+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIUX6BGASDIWMHEB","created_at":"2026-07-05T07:32:12.103153+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIUX6BGA","created_at":"2026-07-05T07:32:12.103153+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13483","citing_title":"Oriented Trees in Digraphs without Oriented $4$-cycles","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW","json":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW.json","graph_json":"https://pith.science/api/pith-number/QIUX6BGASDIWMHEBRDR2ZTEPMW/graph.json","events_json":"https://pith.science/api/pith-number/QIUX6BGASDIWMHEBRDR2ZTEPMW/events.json","paper":"https://pith.science/paper/QIUX6BGA"},"agent_actions":{"view_html":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW","download_json":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW.json","view_paper":"https://pith.science/paper/QIUX6BGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.05205&json=true","fetch_graph":"https://pith.science/api/pith-number/QIUX6BGASDIWMHEBRDR2ZTEPMW/graph.json","fetch_events":"https://pith.science/api/pith-number/QIUX6BGASDIWMHEBRDR2ZTEPMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW/action/storage_attestation","attest_author":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW/action/author_attestation","sign_citation":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW/action/citation_signature","submit_replication":"https://pith.science/pith/QIUX6BGASDIWMHEBRDR2ZTEPMW/action/replication_record"}},"created_at":"2026-07-05T07:32:12.103153+00:00","updated_at":"2026-07-05T07:32:12.103153+00:00"}