{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AHJLT64BCY2W2U6VRCDR3IHKL3","short_pith_number":"pith:AHJLT64B","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"},"canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","source":{"kind":"arxiv","id":"1812.06342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06342","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06342v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06342","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"AHJLT64BCY2W","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHJLT64BCY2W2U6V","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHJLT64B","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AHJLT64BCY2W2U6VRCDR3IHKL3","target":"record","payload":{"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"},"canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","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"},"source_kind":"arxiv","source_id":"1812.06342","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhQwvNLgRlqPd+XDkqI/JVz5tuZx5oLgOWU6WZFp6ifowMucahLKYVuaF7m7TRActvpheoJ0zV4gMR31Axl3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:54:24.767650Z"},"content_sha256":"5515dab93e0a2a8a9d95b8230c7ded07692f3abef796d5814b15328f27736f2f","schema_version":"1.0","event_id":"sha256:5515dab93e0a2a8a9d95b8230c7ded07692f3abef796d5814b15328f27736f2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AHJLT64BCY2W2U6VRCDR3IHKL3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7b7QQUkuwA8YiMLsfFpxtDcdgqlI7XkistnoCbbuSLSokSBlxc5D8qgQVN+6g3C2+4aRrG58TheBZ/X2qHrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:54:24.767999Z"},"content_sha256":"4eb3617738ef49fcfe12defd0725e214be7819db709ac9355f8da7c388c307c0","schema_version":"1.0","event_id":"sha256:4eb3617738ef49fcfe12defd0725e214be7819db709ac9355f8da7c388c307c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/bundle.json","state_url":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T05:54:24Z","links":{"resolver":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3","bundle":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/bundle.json","state":"https://pith.science/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHJLT64BCY2W2U6VRCDR3IHKL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AHJLT64BCY2W2U6VRCDR3IHKL3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"03ab792513ec23b0c42f77fcedaa54d516592cde509da403f97283892a017500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-15T19:39:14Z","title_canon_sha256":"3ff43ee646ac2620cb7ec12bc4f96256350a09d11b0dafb573ce5264b15b7444"},"schema_version":"1.0","source":{"id":"1812.06342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06342","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06342v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06342","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"AHJLT64BCY2W","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AHJLT64BCY2W2U6V","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AHJLT64B","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:4eb3617738ef49fcfe12defd0725e214be7819db709ac9355f8da7c388c307c0","target":"graph","created_at":"2026-05-17T23:58:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A.P. Figueroa, J.J. Montellano-Ballesteros, M. Olsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-15T19:39:14Z","title":"Decomposition of balanced multipartite tournaments into strongly connected tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06342","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5515dab93e0a2a8a9d95b8230c7ded07692f3abef796d5814b15328f27736f2f","target":"record","created_at":"2026-05-17T23:58:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"03ab792513ec23b0c42f77fcedaa54d516592cde509da403f97283892a017500","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-15T19:39:14Z","title_canon_sha256":"3ff43ee646ac2620cb7ec12bc4f96256350a09d11b0dafb573ce5264b15b7444"},"schema_version":"1.0","source":{"id":"1812.06342","kind":"arxiv","version":1}},"canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d2b9fb8116356d53d588871da0ea5eee441d17d9be9d7354e88d7230c5fcb6","first_computed_at":"2026-05-17T23:58:10.513212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.513212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSMBcfA33pcUz0Y7hTcH6ioaNnzD8ArFGeWRs/lFZPPSKhCRFwNIV69Fkw9sDgd2W1dcj2Us1pfJ5XC4VArTCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.513691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5515dab93e0a2a8a9d95b8230c7ded07692f3abef796d5814b15328f27736f2f","sha256:4eb3617738ef49fcfe12defd0725e214be7819db709ac9355f8da7c388c307c0"],"state_sha256":"cb10c597c20300e6b1823e3daa01fe108de7b689bf9b078d356011bbfac62d55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"33UouycqKfmHYtSokOta3sXLbLQSMTZXtRoRXUt9/ddh1zyJciMa4RCj+ia7En2jYkCuzhTOr6pHWcCrbG0BCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:54:24.770038Z","bundle_sha256":"543efcc0e15631af6e3856a15095e848dade3edc12145f5c4073621c05e1c1c2"}}