{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DOXCT2DWYJUHWKWS5V2MMJBSJE","short_pith_number":"pith:DOXCT2DW","schema_version":"1.0","canonical_sha256":"1bae29e876c2687b2ad2ed74c62432493988874601c1a01b2a6de04ba1d7f606","source":{"kind":"arxiv","id":"1508.00645","version":1},"attestation_state":"computed","paper":{"title":"Decompositions of complete multigraphs into cycles of varying lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barbara Maenhaut, Benjamin R. Smith, Daniel Horsley, Darryn Bryant","submitted_at":"2015-08-04T02:41:15Z","abstract_excerpt":"We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching."},"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":"1508.00645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-04T02:41:15Z","cross_cats_sorted":[],"title_canon_sha256":"18ad0e58f36924774f0e878e779d8e35309540b7eb629503ab2179f4a4b2093d","abstract_canon_sha256":"9e6df2d69ccf8afdb2d4134418333c8113b0c8dbed90b6d41e6c1e15d2e88908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:53.783936Z","signature_b64":"8haM64424EcdGIiQAaLVWCfmfRpUx+kbHu/gGKIpCpJlKrgdmnKIyAp4y8hCv/TctIRRqjv6+yhCsSMLwp+xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bae29e876c2687b2ad2ed74c62432493988874601c1a01b2a6de04ba1d7f606","last_reissued_at":"2026-05-18T01:35:53.783365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:53.783365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decompositions of complete multigraphs into cycles of varying lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Barbara Maenhaut, Benjamin R. Smith, Daniel Horsley, Darryn Bryant","submitted_at":"2015-08-04T02:41:15Z","abstract_excerpt":"We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00645","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":"1508.00645","created_at":"2026-05-18T01:35:53.783464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00645v1","created_at":"2026-05-18T01:35:53.783464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00645","created_at":"2026-05-18T01:35:53.783464+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOXCT2DWYJUH","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOXCT2DWYJUHWKWS","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOXCT2DW","created_at":"2026-05-18T12:29:17.054201+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/DOXCT2DWYJUHWKWS5V2MMJBSJE","json":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE.json","graph_json":"https://pith.science/api/pith-number/DOXCT2DWYJUHWKWS5V2MMJBSJE/graph.json","events_json":"https://pith.science/api/pith-number/DOXCT2DWYJUHWKWS5V2MMJBSJE/events.json","paper":"https://pith.science/paper/DOXCT2DW"},"agent_actions":{"view_html":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE","download_json":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE.json","view_paper":"https://pith.science/paper/DOXCT2DW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00645&json=true","fetch_graph":"https://pith.science/api/pith-number/DOXCT2DWYJUHWKWS5V2MMJBSJE/graph.json","fetch_events":"https://pith.science/api/pith-number/DOXCT2DWYJUHWKWS5V2MMJBSJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE/action/storage_attestation","attest_author":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE/action/author_attestation","sign_citation":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE/action/citation_signature","submit_replication":"https://pith.science/pith/DOXCT2DWYJUHWKWS5V2MMJBSJE/action/replication_record"}},"created_at":"2026-05-18T01:35:53.783464+00:00","updated_at":"2026-05-18T01:35:53.783464+00:00"}