{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WPUXG5575FNBWONA44YAVGR6YM","short_pith_number":"pith:WPUXG557","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"},"canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","source":{"kind":"arxiv","id":"1707.06317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06317","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06317v1","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06317","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"WPUXG5575FNB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPUXG5575FNBWONA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPUXG557","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WPUXG5575FNBWONA44YAVGR6YM","target":"record","payload":{"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"},"canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","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"},"source_kind":"arxiv","source_id":"1707.06317","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mjgb5h6k7I2vmjblNggqavT+9BYUkuFH2NHNvSUgfK+OXmfxzdV4oajkO00Ri2aEvEXeIU3ob0g8lodVFMDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:49:42.738463Z"},"content_sha256":"4e03781683d07d0148aa4d2fdace8ab8d6b37b67141be2445f76eb2adbbad14c","schema_version":"1.0","event_id":"sha256:4e03781683d07d0148aa4d2fdace8ab8d6b37b67141be2445f76eb2adbbad14c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WPUXG5575FNBWONA44YAVGR6YM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAPTccRqQhzgBiV8+eoCTt0tN7C9o2WaNMPGt4DQn43MbI0oSVwaNSspHP5pzUrflsW+pZAozNK+Qp8GQZxzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:49:42.738808Z"},"content_sha256":"0ec2f4334d2240ff1c512474151464dc6eb05819a4d2d73bc8fe661c27a3907e","schema_version":"1.0","event_id":"sha256:0ec2f4334d2240ff1c512474151464dc6eb05819a4d2d73bc8fe661c27a3907e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/bundle.json","state_url":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPUXG5575FNBWONA44YAVGR6YM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T09:49:42Z","links":{"resolver":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM","bundle":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/bundle.json","state":"https://pith.science/pith/WPUXG5575FNBWONA44YAVGR6YM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPUXG5575FNBWONA44YAVGR6YM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WPUXG5575FNBWONA44YAVGR6YM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d88bba8c64f051c43d27f272a0db84f33f2ca06332a70b75b2343b6331bc50a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T22:45:05Z","title_canon_sha256":"ed606204ada11131dae17068315bdf9629f9812b42f5cabe9fa29a057ad74f22"},"schema_version":"1.0","source":{"id":"1707.06317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06317","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06317v1","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06317","created_at":"2026-05-18T00:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"WPUXG5575FNB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WPUXG5575FNBWONA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WPUXG557","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:0ec2f4334d2240ff1c512474151464dc6eb05819a4d2d73bc8fe661c27a3907e","target":"graph","created_at":"2026-05-18T00:39:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Peter Danziger, Sophia Park","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T22:45:05Z","title":"Orthogonally Resolvable Matching Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06317","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4e03781683d07d0148aa4d2fdace8ab8d6b37b67141be2445f76eb2adbbad14c","target":"record","created_at":"2026-05-18T00:39:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d88bba8c64f051c43d27f272a0db84f33f2ca06332a70b75b2343b6331bc50a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T22:45:05Z","title_canon_sha256":"ed606204ada11131dae17068315bdf9629f9812b42f5cabe9fa29a057ad74f22"},"schema_version":"1.0","source":{"id":"1707.06317","kind":"arxiv","version":1}},"canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3e97377bfe95a1b39a0e7300a9a3ec306a560d014418a314e88cb1b655b6999","first_computed_at":"2026-05-18T00:39:54.153596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:54.153596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gS5/b5aKsG4ys77YfpMFmA+NMpJl8xhMAuB6b7+wrAndjw0+FZf/f+FPyKi4YryKLmih7bo7FvVjTRVwBoL2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:54.154210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e03781683d07d0148aa4d2fdace8ab8d6b37b67141be2445f76eb2adbbad14c","sha256:0ec2f4334d2240ff1c512474151464dc6eb05819a4d2d73bc8fe661c27a3907e"],"state_sha256":"4a373ddfa2886aaf5793e8d66e2853f9835c18caf1a1d4f9c3cb21aa5e8733da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPUhVmcXVyDoXp7f78/7Dk0OisBKrORJdazxMBgHM+tB9iE9dtVAS3h8+d6hjhSRS3mCDP3RvLkl0IdLVvWtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:49:42.740658Z","bundle_sha256":"30b1b6f8b1dab3d1f326b751e38b2bc5b7f2cb8ecbdfbd1fe43a0a69a2caf77d"}}