{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J33XHIIVAMMAGZ3S347CNK5M5M","short_pith_number":"pith:J33XHIIV","schema_version":"1.0","canonical_sha256":"4ef773a1150318036772df3e26abaceb1abe944da4fdcd9f02940efb2bc14b35","source":{"kind":"arxiv","id":"1611.03221","version":1},"attestation_state":"computed","paper":{"title":"Indecomposable $1$-factorizations of the complete multigraph $\\lambda K_{2n}$ for every $\\lambda\\leq 2n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gloria Rinaldi, Simona Bonvicini","submitted_at":"2016-11-10T08:54:40Z","abstract_excerpt":"A $1$-factorization of the complete multigraph $\\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\\lambda_0 K_{2n}$ and $(\\lambda-\\lambda_0) K_{2n}$, where $\\lambda_0<\\lambda$. It is said to be simple if no $1$-factor is repeated. For every $n\\geq 9$ and for every $(n-2)/3\\leq\\lambda\\leq 2n$, we construct an indecomposable $1$-factorization of $\\lambda K_{2n}$ which is not simple. These $1$-factorizations provide simple and indecomposable $1$-factorizations of $\\lambda K_{2s}$ for every $s\\geq 18$ and $2\\leq\\lambda\\leq 2\\lfloor s/2\\"},"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.03221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-10T08:54:40Z","cross_cats_sorted":[],"title_canon_sha256":"277f0375e55f532497a40119cc2c9d11c14c12d5654c75010b9126ca296a8c9b","abstract_canon_sha256":"0681ac21084a5c965ad66578d7d26f410d1d3b7fa7e4e4d6b971d76a160b4315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.954399Z","signature_b64":"l4wyuEFPcVU/Rz93T6c0B+LxTxKS0+Ow+8uipButvSVKApCfm4QSlSdbAcfmkrb0w0wb1VLGqN5KuWLHzeJhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ef773a1150318036772df3e26abaceb1abe944da4fdcd9f02940efb2bc14b35","last_reissued_at":"2026-05-18T00:59:40.953646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.953646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indecomposable $1$-factorizations of the complete multigraph $\\lambda K_{2n}$ for every $\\lambda\\leq 2n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gloria Rinaldi, Simona Bonvicini","submitted_at":"2016-11-10T08:54:40Z","abstract_excerpt":"A $1$-factorization of the complete multigraph $\\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\\lambda_0 K_{2n}$ and $(\\lambda-\\lambda_0) K_{2n}$, where $\\lambda_0<\\lambda$. It is said to be simple if no $1$-factor is repeated. For every $n\\geq 9$ and for every $(n-2)/3\\leq\\lambda\\leq 2n$, we construct an indecomposable $1$-factorization of $\\lambda K_{2n}$ which is not simple. These $1$-factorizations provide simple and indecomposable $1$-factorizations of $\\lambda K_{2s}$ for every $s\\geq 18$ and $2\\leq\\lambda\\leq 2\\lfloor s/2\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03221","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.03221","created_at":"2026-05-18T00:59:40.953770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03221v1","created_at":"2026-05-18T00:59:40.953770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03221","created_at":"2026-05-18T00:59:40.953770+00:00"},{"alias_kind":"pith_short_12","alias_value":"J33XHIIVAMMA","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J33XHIIVAMMAGZ3S","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J33XHIIV","created_at":"2026-05-18T12:30:22.444734+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/J33XHIIVAMMAGZ3S347CNK5M5M","json":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M.json","graph_json":"https://pith.science/api/pith-number/J33XHIIVAMMAGZ3S347CNK5M5M/graph.json","events_json":"https://pith.science/api/pith-number/J33XHIIVAMMAGZ3S347CNK5M5M/events.json","paper":"https://pith.science/paper/J33XHIIV"},"agent_actions":{"view_html":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M","download_json":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M.json","view_paper":"https://pith.science/paper/J33XHIIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03221&json=true","fetch_graph":"https://pith.science/api/pith-number/J33XHIIVAMMAGZ3S347CNK5M5M/graph.json","fetch_events":"https://pith.science/api/pith-number/J33XHIIVAMMAGZ3S347CNK5M5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M/action/storage_attestation","attest_author":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M/action/author_attestation","sign_citation":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M/action/citation_signature","submit_replication":"https://pith.science/pith/J33XHIIVAMMAGZ3S347CNK5M5M/action/replication_record"}},"created_at":"2026-05-18T00:59:40.953770+00:00","updated_at":"2026-05-18T00:59:40.953770+00:00"}