{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YUAYOV2MR3QH3B4UWTWBVVLZSJ","short_pith_number":"pith:YUAYOV2M","schema_version":"1.0","canonical_sha256":"c50187574c8ee07d8794b4ec1ad579926834848da998b10f1e727585c938e2e0","source":{"kind":"arxiv","id":"1603.06625","version":1},"attestation_state":"computed","paper":{"title":"On a generalization of the seating couples problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kohen, Iv\\'an Sadofschi Costa","submitted_at":"2016-03-21T21:34:23Z","abstract_excerpt":"We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of $2n$ seats. Concretely, we prove that given a positive integer $n$ and $d_1,\\ldots,d_n\\in(\\mathbb{Z}/2n)^*$ we can partition $\\mathbb{Z}/2n$ into $n$ pairs with differences $d_1,\\ldots,d_n$."},"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":"1603.06625","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-21T21:34:23Z","cross_cats_sorted":[],"title_canon_sha256":"ac0fdc3d53b23592b79b3e12e20e2bbed03c2f337bfa9a8a1ae83ab57e8706c9","abstract_canon_sha256":"5f52e1fbd73c926927338e3e642f75294a265d2fe1b235e05c71debb3657eb67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:35.077513Z","signature_b64":"HjPlBv7pjS2FU2ZN7w5t1ctlU78JEqoUH1vkROA/mBYhrRHrucwK9QTzdbCxg2nzMM1fa0EZoa3M2Q7zEkSeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50187574c8ee07d8794b4ec1ad579926834848da998b10f1e727585c938e2e0","last_reissued_at":"2026-05-18T01:18:35.076991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:35.076991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a generalization of the seating couples problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kohen, Iv\\'an Sadofschi Costa","submitted_at":"2016-03-21T21:34:23Z","abstract_excerpt":"We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of $2n$ seats. Concretely, we prove that given a positive integer $n$ and $d_1,\\ldots,d_n\\in(\\mathbb{Z}/2n)^*$ we can partition $\\mathbb{Z}/2n$ into $n$ pairs with differences $d_1,\\ldots,d_n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06625","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":"1603.06625","created_at":"2026-05-18T01:18:35.077077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06625v1","created_at":"2026-05-18T01:18:35.077077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06625","created_at":"2026-05-18T01:18:35.077077+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUAYOV2MR3QH","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUAYOV2MR3QH3B4U","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUAYOV2M","created_at":"2026-05-18T12:30:53.716459+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/YUAYOV2MR3QH3B4UWTWBVVLZSJ","json":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ.json","graph_json":"https://pith.science/api/pith-number/YUAYOV2MR3QH3B4UWTWBVVLZSJ/graph.json","events_json":"https://pith.science/api/pith-number/YUAYOV2MR3QH3B4UWTWBVVLZSJ/events.json","paper":"https://pith.science/paper/YUAYOV2M"},"agent_actions":{"view_html":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ","download_json":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ.json","view_paper":"https://pith.science/paper/YUAYOV2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06625&json=true","fetch_graph":"https://pith.science/api/pith-number/YUAYOV2MR3QH3B4UWTWBVVLZSJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YUAYOV2MR3QH3B4UWTWBVVLZSJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ/action/storage_attestation","attest_author":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ/action/author_attestation","sign_citation":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ/action/citation_signature","submit_replication":"https://pith.science/pith/YUAYOV2MR3QH3B4UWTWBVVLZSJ/action/replication_record"}},"created_at":"2026-05-18T01:18:35.077077+00:00","updated_at":"2026-05-18T01:18:35.077077+00:00"}