{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MFZPMNCXYEMB3FEHKETTXMVNL2","short_pith_number":"pith:MFZPMNCX","schema_version":"1.0","canonical_sha256":"6172f63457c1181d948751273bb2ad5eb959a0475282e738c59c1ab81e102a0c","source":{"kind":"arxiv","id":"2607.01130","version":1},"attestation_state":"computed","paper":{"title":"A complete solution to the generalized honeymoon Oberwolfach problem with one round table","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masoomeh Akbari","submitted_at":"2026-07-01T16:15:54Z","abstract_excerpt":"The generalized honeymoon Oberwolfach problem (HOP) asks whether it is possible to seat $2n$ participants consisting of $n$ newlywed couples at a conference with $s$ tables of size $2$ and $t$ \"round'' tables of sizes $2m_1, 2m_2, \\ldots, 2m_t$, where $n = s + \\sum_{i=1}^{t} m_i $ with all $m_i \\geq 2$, over several nights so that each participant sits next to their spouse every time and next to each other participant exactly once. We denote this problem by $HOP(2^{\\langle s \\rangle}, 2m_1, \\ldots, 2m_t)$. In this paper, we provide a complete solution to the generalized HOP with one round tabl"},"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":"2607.01130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-01T16:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"b0238892317f2445420392995cb950e43010fbf8521fa56d0c6eb4db51672667","abstract_canon_sha256":"50f8b85ea46f1b7b1a0a3e316d7a16be37e7de2736a142b4204ad252251dcc91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:29.937755Z","signature_b64":"FNPJzQHm9JTsVsZQO+VtsZDpXKsyBgTl6hqcVRz2Bn6Sh0r0tNyqn3eFmmjaiHUM5BWAHoLxV6vbp6GIygB6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6172f63457c1181d948751273bb2ad5eb959a0475282e738c59c1ab81e102a0c","last_reissued_at":"2026-07-02T01:18:29.937334Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:29.937334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complete solution to the generalized honeymoon Oberwolfach problem with one round table","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Masoomeh Akbari","submitted_at":"2026-07-01T16:15:54Z","abstract_excerpt":"The generalized honeymoon Oberwolfach problem (HOP) asks whether it is possible to seat $2n$ participants consisting of $n$ newlywed couples at a conference with $s$ tables of size $2$ and $t$ \"round'' tables of sizes $2m_1, 2m_2, \\ldots, 2m_t$, where $n = s + \\sum_{i=1}^{t} m_i $ with all $m_i \\geq 2$, over several nights so that each participant sits next to their spouse every time and next to each other participant exactly once. We denote this problem by $HOP(2^{\\langle s \\rangle}, 2m_1, \\ldots, 2m_t)$. In this paper, we provide a complete solution to the generalized HOP with one round tabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01130/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":"2607.01130","created_at":"2026-07-02T01:18:29.937401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01130v1","created_at":"2026-07-02T01:18:29.937401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01130","created_at":"2026-07-02T01:18:29.937401+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFZPMNCXYEMB","created_at":"2026-07-02T01:18:29.937401+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFZPMNCXYEMB3FEH","created_at":"2026-07-02T01:18:29.937401+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFZPMNCX","created_at":"2026-07-02T01:18:29.937401+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/MFZPMNCXYEMB3FEHKETTXMVNL2","json":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2.json","graph_json":"https://pith.science/api/pith-number/MFZPMNCXYEMB3FEHKETTXMVNL2/graph.json","events_json":"https://pith.science/api/pith-number/MFZPMNCXYEMB3FEHKETTXMVNL2/events.json","paper":"https://pith.science/paper/MFZPMNCX"},"agent_actions":{"view_html":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2","download_json":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2.json","view_paper":"https://pith.science/paper/MFZPMNCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01130&json=true","fetch_graph":"https://pith.science/api/pith-number/MFZPMNCXYEMB3FEHKETTXMVNL2/graph.json","fetch_events":"https://pith.science/api/pith-number/MFZPMNCXYEMB3FEHKETTXMVNL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2/action/storage_attestation","attest_author":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2/action/author_attestation","sign_citation":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2/action/citation_signature","submit_replication":"https://pith.science/pith/MFZPMNCXYEMB3FEHKETTXMVNL2/action/replication_record"}},"created_at":"2026-07-02T01:18:29.937401+00:00","updated_at":"2026-07-02T01:18:29.937401+00:00"}