{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NSX4XHE6UXLZL54VOPVX7SY4EU","short_pith_number":"pith:NSX4XHE6","schema_version":"1.0","canonical_sha256":"6cafcb9c9ea5d795f79573eb7fcb1c25318f91729f38b62c9d41bc1c03e00c39","source":{"kind":"arxiv","id":"2503.09325","version":2},"attestation_state":"computed","paper":{"title":"$\\lambda$-fold near-factorizations of groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Donald L. Kreher, Douglas R. Stinson, Shuxing Li","submitted_at":"2025-03-12T12:20:04Z","abstract_excerpt":"We initiate the study of $\\lambda$-fold near-factorizations of groups with $\\lambda > 1$. While $\\lambda$-fold near-factorizations of groups with $\\lambda = 1$ have been studied in numerous papers, this is the first detailed treatment for $\\lambda > 1$. We establish fundamental properties of $\\lambda$-fold near-factorizations and introduce the notion of equivalence. We prove various necessary conditions of $\\lambda$-fold near-factorizations, including upper bounds on $\\lambda$. We present three constructions of infinite families of $\\lambda$-fold near-factorizations, highlighting the character"},"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":"2503.09325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2025-03-12T12:20:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"06e7c45d1dbf5f61b0f0375cc8024aa61ffd55bb0f9fd8f5a87f21fba08960cf","abstract_canon_sha256":"d9ce965f9445b95c089a62999d16bd045671b1b3b3aeb4a44bd155d54f717424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:39.830131Z","signature_b64":"5ddWavrEkzHN3Gt90GrgNTvBkHJFgDvSpgZXHTf5r54RhSvP/kJDZD1C9lwx+PMyxXBbD28kjRW+NS2LbkuuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cafcb9c9ea5d795f79573eb7fcb1c25318f91729f38b62c9d41bc1c03e00c39","last_reissued_at":"2026-07-05T10:52:39.829663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:39.829663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\lambda$-fold near-factorizations of groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.GR","authors_text":"Donald L. Kreher, Douglas R. Stinson, Shuxing Li","submitted_at":"2025-03-12T12:20:04Z","abstract_excerpt":"We initiate the study of $\\lambda$-fold near-factorizations of groups with $\\lambda > 1$. While $\\lambda$-fold near-factorizations of groups with $\\lambda = 1$ have been studied in numerous papers, this is the first detailed treatment for $\\lambda > 1$. We establish fundamental properties of $\\lambda$-fold near-factorizations and introduce the notion of equivalence. We prove various necessary conditions of $\\lambda$-fold near-factorizations, including upper bounds on $\\lambda$. We present three constructions of infinite families of $\\lambda$-fold near-factorizations, highlighting the character"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.09325","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.09325/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.09325","created_at":"2026-07-05T10:52:39.829716+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.09325v2","created_at":"2026-07-05T10:52:39.829716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.09325","created_at":"2026-07-05T10:52:39.829716+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSX4XHE6UXLZ","created_at":"2026-07-05T10:52:39.829716+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSX4XHE6UXLZL54V","created_at":"2026-07-05T10:52:39.829716+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSX4XHE6","created_at":"2026-07-05T10:52:39.829716+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.14848","citing_title":"On Matrix Product Factorization in Association Schemes","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU","json":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU.json","graph_json":"https://pith.science/api/pith-number/NSX4XHE6UXLZL54VOPVX7SY4EU/graph.json","events_json":"https://pith.science/api/pith-number/NSX4XHE6UXLZL54VOPVX7SY4EU/events.json","paper":"https://pith.science/paper/NSX4XHE6"},"agent_actions":{"view_html":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU","download_json":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU.json","view_paper":"https://pith.science/paper/NSX4XHE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.09325&json=true","fetch_graph":"https://pith.science/api/pith-number/NSX4XHE6UXLZL54VOPVX7SY4EU/graph.json","fetch_events":"https://pith.science/api/pith-number/NSX4XHE6UXLZL54VOPVX7SY4EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU/action/storage_attestation","attest_author":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU/action/author_attestation","sign_citation":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU/action/citation_signature","submit_replication":"https://pith.science/pith/NSX4XHE6UXLZL54VOPVX7SY4EU/action/replication_record"}},"created_at":"2026-07-05T10:52:39.829716+00:00","updated_at":"2026-07-05T10:52:39.829716+00:00"}