{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C6UIVD3K4ERMENUEMTOPNAQYUF","short_pith_number":"pith:C6UIVD3K","schema_version":"1.0","canonical_sha256":"17a88a8f6ae122c2368464dcf68218a14ccc64d6360d732e172f14187a86c1c8","source":{"kind":"arxiv","id":"1404.3890","version":2},"attestation_state":"computed","paper":{"title":"A generalization of the problem of Mariusz Meszka","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Pasotti, Marco Antonio Pellegrini","submitted_at":"2014-04-15T12:31:57Z","abstract_excerpt":"Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this problem to the case in which p is an odd integer not necessarily prime. In particular, we give a necessary condition for the existence of such a near 1-factor for any odd integer p. We show that this condition is also sufficient for any list L whose underlying set S has size 1, 2, or n. Then we prove that the conjecture is true if S={1,2,t} for any positive inte"},"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":"1404.3890","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-15T12:31:57Z","cross_cats_sorted":[],"title_canon_sha256":"c2f9c1060fe6db61c602be309c55cd99cb61be95c46c6afbe09d3b419acf09d7","abstract_canon_sha256":"8e384f2f66759fe0eb1a3ae030b0ca7d255340fe15dacfdae16b9e4f338b54f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:32.645671Z","signature_b64":"QeKBNkiyW/sFhW0GrQ2Miw/K3gFCbjZ5gRcbGYEX2Imo1JVA7ee+mKwNKugfd43xXzVimgSavkI+DrEBSCveDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17a88a8f6ae122c2368464dcf68218a14ccc64d6360d732e172f14187a86c1c8","last_reissued_at":"2026-05-18T02:25:32.645212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:32.645212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of the problem of Mariusz Meszka","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Pasotti, Marco Antonio Pellegrini","submitted_at":"2014-04-15T12:31:57Z","abstract_excerpt":"Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this problem to the case in which p is an odd integer not necessarily prime. In particular, we give a necessary condition for the existence of such a near 1-factor for any odd integer p. We show that this condition is also sufficient for any list L whose underlying set S has size 1, 2, or n. Then we prove that the conjecture is true if S={1,2,t} for any positive inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3890","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":""},"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":"1404.3890","created_at":"2026-05-18T02:25:32.645281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3890v2","created_at":"2026-05-18T02:25:32.645281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3890","created_at":"2026-05-18T02:25:32.645281+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6UIVD3K4ERM","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6UIVD3K4ERMENUE","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6UIVD3K","created_at":"2026-05-18T12:28:22.404517+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/C6UIVD3K4ERMENUEMTOPNAQYUF","json":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF.json","graph_json":"https://pith.science/api/pith-number/C6UIVD3K4ERMENUEMTOPNAQYUF/graph.json","events_json":"https://pith.science/api/pith-number/C6UIVD3K4ERMENUEMTOPNAQYUF/events.json","paper":"https://pith.science/paper/C6UIVD3K"},"agent_actions":{"view_html":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF","download_json":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF.json","view_paper":"https://pith.science/paper/C6UIVD3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3890&json=true","fetch_graph":"https://pith.science/api/pith-number/C6UIVD3K4ERMENUEMTOPNAQYUF/graph.json","fetch_events":"https://pith.science/api/pith-number/C6UIVD3K4ERMENUEMTOPNAQYUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF/action/storage_attestation","attest_author":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF/action/author_attestation","sign_citation":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF/action/citation_signature","submit_replication":"https://pith.science/pith/C6UIVD3K4ERMENUEMTOPNAQYUF/action/replication_record"}},"created_at":"2026-05-18T02:25:32.645281+00:00","updated_at":"2026-05-18T02:25:32.645281+00:00"}