{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NYYNLSRA2VZ3EFOZF7PAUB6JME","short_pith_number":"pith:NYYNLSRA","canonical_record":{"source":{"id":"1609.01675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T17:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"c4235652aa31f193d9275ca1dc80b08ce0d783a7ba4caf6dc95d10e4926bdf30","abstract_canon_sha256":"42fd0d9d86a1f02dcd064a0b4cf67e2822ae6f70a0cf648a37c96e90d3ceb887"},"schema_version":"1.0"},"canonical_sha256":"6e30d5ca20d573b215d92fde0a07c96120ebb58a8f3a711ecac4437d6fa962ff","source":{"kind":"arxiv","id":"1609.01675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01675","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01675v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01675","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"NYYNLSRA2VZ3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYYNLSRA2VZ3EFOZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYYNLSRA","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NYYNLSRA2VZ3EFOZF7PAUB6JME","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T17:56:34Z","cross_cats_sorted":[],"title_canon_sha256":"c4235652aa31f193d9275ca1dc80b08ce0d783a7ba4caf6dc95d10e4926bdf30","abstract_canon_sha256":"42fd0d9d86a1f02dcd064a0b4cf67e2822ae6f70a0cf648a37c96e90d3ceb887"},"schema_version":"1.0"},"canonical_sha256":"6e30d5ca20d573b215d92fde0a07c96120ebb58a8f3a711ecac4437d6fa962ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.012559Z","signature_b64":"d6ow94ZsGAIIsuhEECt9K4Wtm/4kAURxMYPhX6rhDCO506v9wPfKXWtRudFdEFGennIYnyCeIM1D42955dShAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e30d5ca20d573b215d92fde0a07c96120ebb58a8f3a711ecac4437d6fa962ff","last_reissued_at":"2026-05-18T01:05:39.012127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.012127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01675","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-18T01:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsANtKRO8hY8yWReoI9FQfcf4ohTwCUuS/OmA94WTXM7vHziKxD5Q8RmCfOShr+Vm4fE88S8wKdK+LPHPCclDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:36:22.969541Z"},"content_sha256":"032d692b09b5dbc5cbd279fc592b89625eb90931bc1cbab795aeda4cb3a5ccca","schema_version":"1.0","event_id":"sha256:032d692b09b5dbc5cbd279fc592b89625eb90931bc1cbab795aeda4cb3a5ccca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NYYNLSRA2VZ3EFOZF7PAUB6JME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afsaneh Khodadadpour, Gholamreza Omidi, Ramin Javadi","submitted_at":"2016-09-06T17:56:34Z","abstract_excerpt":"In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and Pettersson in 2014. Moreover, in 1983, Tarsi conjectured that the obvious necessary conditions for packing pairwise edge-disjoint paths of arbitrary lengths in the complete multigraphs were also sufficient. The conjecture was confirmed by Bryant in 2010. In this paper, we investigate an analogous problem as the decomposition of the complete uniform multi-hyperg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01675","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-18T01:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ka0+Q7g0TqQgdc0LKXGvldAgprQPpNHycwCpjRBviC8dcDVSJvNo0s0k7zXOLgwyLr7SkkI3bUa+Hh3EzcwsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:36:22.969888Z"},"content_sha256":"d25231f14f32f256b1cda70c0439b8263942412080716eb6bfc9ebc71a025f53","schema_version":"1.0","event_id":"sha256:d25231f14f32f256b1cda70c0439b8263942412080716eb6bfc9ebc71a025f53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/bundle.json","state_url":"https://pith.science/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/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-02T18:36:22Z","links":{"resolver":"https://pith.science/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME","bundle":"https://pith.science/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/bundle.json","state":"https://pith.science/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYYNLSRA2VZ3EFOZF7PAUB6JME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NYYNLSRA2VZ3EFOZF7PAUB6JME","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":"42fd0d9d86a1f02dcd064a0b4cf67e2822ae6f70a0cf648a37c96e90d3ceb887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T17:56:34Z","title_canon_sha256":"c4235652aa31f193d9275ca1dc80b08ce0d783a7ba4caf6dc95d10e4926bdf30"},"schema_version":"1.0","source":{"id":"1609.01675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01675","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01675v1","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01675","created_at":"2026-05-18T01:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"NYYNLSRA2VZ3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYYNLSRA2VZ3EFOZ","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYYNLSRA","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:d25231f14f32f256b1cda70c0439b8263942412080716eb6bfc9ebc71a025f53","target":"graph","created_at":"2026-05-18T01:05:39Z","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":"In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and Pettersson in 2014. Moreover, in 1983, Tarsi conjectured that the obvious necessary conditions for packing pairwise edge-disjoint paths of arbitrary lengths in the complete multigraphs were also sufficient. The conjecture was confirmed by Bryant in 2010. In this paper, we investigate an analogous problem as the decomposition of the complete uniform multi-hyperg","authors_text":"Afsaneh Khodadadpour, Gholamreza Omidi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T17:56:34Z","title":"Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01675","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:032d692b09b5dbc5cbd279fc592b89625eb90931bc1cbab795aeda4cb3a5ccca","target":"record","created_at":"2026-05-18T01:05:39Z","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":"42fd0d9d86a1f02dcd064a0b4cf67e2822ae6f70a0cf648a37c96e90d3ceb887","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-06T17:56:34Z","title_canon_sha256":"c4235652aa31f193d9275ca1dc80b08ce0d783a7ba4caf6dc95d10e4926bdf30"},"schema_version":"1.0","source":{"id":"1609.01675","kind":"arxiv","version":1}},"canonical_sha256":"6e30d5ca20d573b215d92fde0a07c96120ebb58a8f3a711ecac4437d6fa962ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e30d5ca20d573b215d92fde0a07c96120ebb58a8f3a711ecac4437d6fa962ff","first_computed_at":"2026-05-18T01:05:39.012127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:39.012127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d6ow94ZsGAIIsuhEECt9K4Wtm/4kAURxMYPhX6rhDCO506v9wPfKXWtRudFdEFGennIYnyCeIM1D42955dShAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:39.012559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:032d692b09b5dbc5cbd279fc592b89625eb90931bc1cbab795aeda4cb3a5ccca","sha256:d25231f14f32f256b1cda70c0439b8263942412080716eb6bfc9ebc71a025f53"],"state_sha256":"4f96554d9fffb674df8143929902acd6fe101807cb36e36f8681918922a59fb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hnq8p4bGpCU5SVPEFGd37i8+C1axTTQVkVaE1th88PAOKvjLziAyFWqhPwOJg2nXinpI9QlNMRk9IW4xeZilAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:36:22.971836Z","bundle_sha256":"7f544d8d650a07bbde15b35aaca645290d5f43d677b589a4ecaa2af29247e394"}}