{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LWQVE32VUCTF4UTLWMZDKQ45SV","short_pith_number":"pith:LWQVE32V","schema_version":"1.0","canonical_sha256":"5da1526f55a0a65e526bb33235439d95629001e010968e0d083b710b2de9ed52","source":{"kind":"arxiv","id":"1611.03244","version":1},"attestation_state":"computed","paper":{"title":"A $\\overrightarrow{P_{3}}$-decomposition of tournaments and bipartite digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Fangxia Wang, Xinhui An","submitted_at":"2016-11-10T10:29:01Z","abstract_excerpt":"A $\\overrightarrow{P_{3}}$-decomposition of a directed graph $D$ is a partition of the arcs of $D$ into directed paths of length $2$. In this paper, we give a characterization for a tournament and a bipartite digraph admitting a $\\overrightarrow{P_{3}}$-decomposition. This solves a problem posed by Diwan ($\\overrightarrow{P_{3}}$-decomposition of directed graphs, Discrete Appl. Math., http:// dx.doi.org/10.1016/j.dam.2016.01.039.)."},"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":"1611.03244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T10:29:01Z","cross_cats_sorted":[],"title_canon_sha256":"26d6e8200657e2b35bea74de486a59755174bd891e808ef85838eb6c8ea44e6c","abstract_canon_sha256":"67127ae4b54eb6d61c68a9b1cb0cf42a9e48c425959381589d44907c134beb18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.860585Z","signature_b64":"5khcCfXBUFy0K5/e4yUttmz7fGMZsTnQ8qf/E7GNKWOGZeoFtEFINf2MoDmiugiSlBy126ThLhRY2VpfjWS/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da1526f55a0a65e526bb33235439d95629001e010968e0d083b710b2de9ed52","last_reissued_at":"2026-05-18T00:59:40.859897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.859897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $\\overrightarrow{P_{3}}$-decomposition of tournaments and bipartite digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Fangxia Wang, Xinhui An","submitted_at":"2016-11-10T10:29:01Z","abstract_excerpt":"A $\\overrightarrow{P_{3}}$-decomposition of a directed graph $D$ is a partition of the arcs of $D$ into directed paths of length $2$. In this paper, we give a characterization for a tournament and a bipartite digraph admitting a $\\overrightarrow{P_{3}}$-decomposition. This solves a problem posed by Diwan ($\\overrightarrow{P_{3}}$-decomposition of directed graphs, Discrete Appl. Math., http:// dx.doi.org/10.1016/j.dam.2016.01.039.)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03244","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":"1611.03244","created_at":"2026-05-18T00:59:40.859984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03244v1","created_at":"2026-05-18T00:59:40.859984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03244","created_at":"2026-05-18T00:59:40.859984+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWQVE32VUCTF","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWQVE32VUCTF4UTL","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWQVE32V","created_at":"2026-05-18T12:30:29.479603+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/LWQVE32VUCTF4UTLWMZDKQ45SV","json":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV.json","graph_json":"https://pith.science/api/pith-number/LWQVE32VUCTF4UTLWMZDKQ45SV/graph.json","events_json":"https://pith.science/api/pith-number/LWQVE32VUCTF4UTLWMZDKQ45SV/events.json","paper":"https://pith.science/paper/LWQVE32V"},"agent_actions":{"view_html":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV","download_json":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV.json","view_paper":"https://pith.science/paper/LWQVE32V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03244&json=true","fetch_graph":"https://pith.science/api/pith-number/LWQVE32VUCTF4UTLWMZDKQ45SV/graph.json","fetch_events":"https://pith.science/api/pith-number/LWQVE32VUCTF4UTLWMZDKQ45SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV/action/storage_attestation","attest_author":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV/action/author_attestation","sign_citation":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV/action/citation_signature","submit_replication":"https://pith.science/pith/LWQVE32VUCTF4UTLWMZDKQ45SV/action/replication_record"}},"created_at":"2026-05-18T00:59:40.859984+00:00","updated_at":"2026-05-18T00:59:40.859984+00:00"}