{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AHJLT64BCY2W2U6VRCDR3IHKL3","short_pith_number":"pith:AHJLT64B","schema_version":"1.0","canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","source":{"kind":"arxiv","id":"1812.06342","version":1},"attestation_state":"computed","paper":{"title":"Decomposition of balanced multipartite tournaments into strongly connected tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.P. Figueroa, J.J. Montellano-Ballesteros, M. Olsen","submitted_at":"2018-12-15T19:39:14Z","abstract_excerpt":"Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and communication. A digraph is strongly connected if it contains a directed path from each vertex to all others. In this paper we consider multipartite tournaments, and we study the existence of a partition of a multipartite tournament with $c$ partite sets into strongly connected $c$-tournaments. This is a continuation of the study started in 1999 by Volkmann of the existence of strongly connected subtournaments in multipar"},"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":"1812.06342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-15T19:39:14Z","cross_cats_sorted":[],"title_canon_sha256":"3ff43ee646ac2620cb7ec12bc4f96256350a09d11b0dafb573ce5264b15b7444","abstract_canon_sha256":"03ab792513ec23b0c42f77fcedaa54d516592cde509da403f97283892a017500"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.513691Z","signature_b64":"KSMBcfA33pcUz0Y7hTcH6ioaNnzD8ArFGeWRs/lFZPPSKhCRFwNIV69Fkw9sDgd2W1dcj2Us1pfJ5XC4VArTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","last_reissued_at":"2026-05-17T23:58:10.513212Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.513212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition of balanced multipartite tournaments into strongly connected tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.P. Figueroa, J.J. Montellano-Ballesteros, M. Olsen","submitted_at":"2018-12-15T19:39:14Z","abstract_excerpt":"Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and communication. A digraph is strongly connected if it contains a directed path from each vertex to all others. In this paper we consider multipartite tournaments, and we study the existence of a partition of a multipartite tournament with $c$ partite sets into strongly connected $c$-tournaments. This is a continuation of the study started in 1999 by Volkmann of the existence of strongly connected subtournaments in multipar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06342","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":"1812.06342","created_at":"2026-05-17T23:58:10.513278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06342v1","created_at":"2026-05-17T23:58:10.513278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06342","created_at":"2026-05-17T23:58:10.513278+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHJLT64BCY2W","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHJLT64BCY2W2U6V","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHJLT64B","created_at":"2026-05-18T12:32:13.499390+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/AHJLT64BCY2W2U6VRCDR3IHKL3","json":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3.json","graph_json":"https://pith.science/api/pith-number/AHJLT64BCY2W2U6VRCDR3IHKL3/graph.json","events_json":"https://pith.science/api/pith-number/AHJLT64BCY2W2U6VRCDR3IHKL3/events.json","paper":"https://pith.science/paper/AHJLT64B"},"agent_actions":{"view_html":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3","download_json":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3.json","view_paper":"https://pith.science/paper/AHJLT64B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06342&json=true","fetch_graph":"https://pith.science/api/pith-number/AHJLT64BCY2W2U6VRCDR3IHKL3/graph.json","fetch_events":"https://pith.science/api/pith-number/AHJLT64BCY2W2U6VRCDR3IHKL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/action/storage_attestation","attest_author":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/action/author_attestation","sign_citation":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/action/citation_signature","submit_replication":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/action/replication_record"}},"created_at":"2026-05-17T23:58:10.513278+00:00","updated_at":"2026-05-17T23:58:10.513278+00:00"}