{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WPUXG5575FNBWONA44YAVGR6YM","short_pith_number":"pith:WPUXG557","schema_version":"1.0","canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","source":{"kind":"arxiv","id":"1707.06317","version":1},"attestation_state":"computed","paper":{"title":"Orthogonally Resolvable Matching Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Danziger, Sophia Park","submitted_at":"2017-07-19T22:45:05Z","abstract_excerpt":"An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be represented as a square array whose cells are either empty or contain a matching of size $k$, where every vertex appears exactly once in each row and column. In this paper we show that an OMD$(n.k)$ exists if and only if $n \\equiv 0 \\pmod{2k}$ except when $k=1$ and $n = 4$ or $6$."},"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":"1707.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T22:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"ed606204ada11131dae17068315bdf9629f9812b42f5cabe9fa29a057ad74f22","abstract_canon_sha256":"d88bba8c64f051c43d27f272a0db84f33f2ca06332a70b75b2343b6331bc50a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:54.154210Z","signature_b64":"gS5/b5aKsG4ys77YfpMFmA+NMpJl8xhMAuB6b7+wrAndjw0+FZf/f+FPyKi4YryKLmih7bo7FvVjTRVwBoL2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","last_reissued_at":"2026-05-18T00:39:54.153596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:54.153596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orthogonally Resolvable Matching Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Danziger, Sophia Park","submitted_at":"2017-07-19T22:45:05Z","abstract_excerpt":"An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be represented as a square array whose cells are either empty or contain a matching of size $k$, where every vertex appears exactly once in each row and column. In this paper we show that an OMD$(n.k)$ exists if and only if $n \\equiv 0 \\pmod{2k}$ except when $k=1$ and $n = 4$ or $6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06317","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":"1707.06317","created_at":"2026-05-18T00:39:54.153685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06317v1","created_at":"2026-05-18T00:39:54.153685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06317","created_at":"2026-05-18T00:39:54.153685+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPUXG5575FNB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPUXG5575FNBWONA","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPUXG557","created_at":"2026-05-18T12:31:53.515858+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/WPUXG5575FNBWONA44YAVGR6YM","json":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM.json","graph_json":"https://pith.science/api/pith-number/WPUXG5575FNBWONA44YAVGR6YM/graph.json","events_json":"https://pith.science/api/pith-number/WPUXG5575FNBWONA44YAVGR6YM/events.json","paper":"https://pith.science/paper/WPUXG557"},"agent_actions":{"view_html":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM","download_json":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM.json","view_paper":"https://pith.science/paper/WPUXG557","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06317&json=true","fetch_graph":"https://pith.science/api/pith-number/WPUXG5575FNBWONA44YAVGR6YM/graph.json","fetch_events":"https://pith.science/api/pith-number/WPUXG5575FNBWONA44YAVGR6YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/action/storage_attestation","attest_author":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/action/author_attestation","sign_citation":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/action/citation_signature","submit_replication":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/action/replication_record"}},"created_at":"2026-05-18T00:39:54.153685+00:00","updated_at":"2026-05-18T00:39:54.153685+00:00"}