{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3QJA47CL6PRFHBLZNZDQBS6QGV","short_pith_number":"pith:3QJA47CL","canonical_record":{"source":{"id":"1509.00569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T06:29:33Z","cross_cats_sorted":[],"title_canon_sha256":"02f77237d839d075f70264f7dbfd673880394fcd8113cbd125fee8ae60a3171c","abstract_canon_sha256":"18d85672e9ac0d113943c6e7896d561e287903cc82c9dcf0e9c1b9c33a14bdf9"},"schema_version":"1.0"},"canonical_sha256":"dc120e7c4bf3e25385796e4700cbd0356b7e352993eb477dc56f51785e89779e","source":{"kind":"arxiv","id":"1509.00569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00569","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00569v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00569","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"3QJA47CL6PRF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QJA47CL6PRFHBLZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QJA47CL","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3QJA47CL6PRFHBLZNZDQBS6QGV","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T06:29:33Z","cross_cats_sorted":[],"title_canon_sha256":"02f77237d839d075f70264f7dbfd673880394fcd8113cbd125fee8ae60a3171c","abstract_canon_sha256":"18d85672e9ac0d113943c6e7896d561e287903cc82c9dcf0e9c1b9c33a14bdf9"},"schema_version":"1.0"},"canonical_sha256":"dc120e7c4bf3e25385796e4700cbd0356b7e352993eb477dc56f51785e89779e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.805691Z","signature_b64":"KBrC3N7ZlY039V3x0LMtBJ/UA2t/u7lWXo7grbN9NCCMN9zty73C/RgUaO/BKvnahvU+n+EKL4kFYuw/bIW2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc120e7c4bf3e25385796e4700cbd0356b7e352993eb477dc56f51785e89779e","last_reissued_at":"2026-05-18T01:34:06.805143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.805143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00569","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-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaiNAfJom6BzonZeFkpOk1Xf674AHj4m57KmSTRYjsNlluPBsJT+NWpCOYFr/r+3imXl21rlUPe4w5cXdQLYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:57:24.959577Z"},"content_sha256":"d7690cb4724eece535970ef46d950f8b030ed8212ad3d702f279ee88ec56b7f5","schema_version":"1.0","event_id":"sha256:d7690cb4724eece535970ef46d950f8b030ed8212ad3d702f279ee88ec56b7f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3QJA47CL6PRFHBLZNZDQBS6QGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The maximum number of perfect matchings of semi-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David G.L. Wang, Hongliang Lu","submitted_at":"2015-09-02T06:29:33Z","abstract_excerpt":"Let $n\\ge 34$ be an even integer, and $D_n=2\\lceil n/4 \\rceil-1$. In this paper, we prove that every $\\{D_n,\\,D_n+1\\}$-graph of order $n$ contains $\\lceil n/4 \\rceil$ disjoint perfect matchings. This result is sharp in the sense that (i) there exists a $\\{D_n,\\,D_n+1\\}$-graph containing exactly $\\lceil n/4 \\rceil$ disjoint perfect matchings, and that (ii) there exists a $\\{D_n-1,\\,D_n\\}$-graph without perfect matchings for each $n$. As a consequence, for any integer $D\\ge D_n$, every $\\{D,\\,D+1\\}$-graph of order $n$ contains $\\lceil (D+1)/2 \\rceil$ disjoint perfect matchings. This extends Csab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00569","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-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYcQjZX55iaHS/zeauSPMQBDZSw6GbDgJCweprfxUCQKQXn3B91zsvG+BDSr1GjPFZN+8yeYBdKsrcD++tkvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:57:24.959920Z"},"content_sha256":"14b803728f10d7cb8783fa26dd8d8fd75d23beeb2bef7fae67c4d119f7bdcac7","schema_version":"1.0","event_id":"sha256:14b803728f10d7cb8783fa26dd8d8fd75d23beeb2bef7fae67c4d119f7bdcac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/bundle.json","state_url":"https://pith.science/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/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-01T19:57:24Z","links":{"resolver":"https://pith.science/pith/3QJA47CL6PRFHBLZNZDQBS6QGV","bundle":"https://pith.science/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/bundle.json","state":"https://pith.science/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QJA47CL6PRFHBLZNZDQBS6QGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3QJA47CL6PRFHBLZNZDQBS6QGV","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":"18d85672e9ac0d113943c6e7896d561e287903cc82c9dcf0e9c1b9c33a14bdf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T06:29:33Z","title_canon_sha256":"02f77237d839d075f70264f7dbfd673880394fcd8113cbd125fee8ae60a3171c"},"schema_version":"1.0","source":{"id":"1509.00569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00569","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00569v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00569","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"3QJA47CL6PRF","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QJA47CL6PRFHBLZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QJA47CL","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:14b803728f10d7cb8783fa26dd8d8fd75d23beeb2bef7fae67c4d119f7bdcac7","target":"graph","created_at":"2026-05-18T01:34:06Z","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":"Let $n\\ge 34$ be an even integer, and $D_n=2\\lceil n/4 \\rceil-1$. In this paper, we prove that every $\\{D_n,\\,D_n+1\\}$-graph of order $n$ contains $\\lceil n/4 \\rceil$ disjoint perfect matchings. This result is sharp in the sense that (i) there exists a $\\{D_n,\\,D_n+1\\}$-graph containing exactly $\\lceil n/4 \\rceil$ disjoint perfect matchings, and that (ii) there exists a $\\{D_n-1,\\,D_n\\}$-graph without perfect matchings for each $n$. As a consequence, for any integer $D\\ge D_n$, every $\\{D,\\,D+1\\}$-graph of order $n$ contains $\\lceil (D+1)/2 \\rceil$ disjoint perfect matchings. This extends Csab","authors_text":"David G.L. Wang, Hongliang Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T06:29:33Z","title":"The maximum number of perfect matchings of semi-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00569","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:d7690cb4724eece535970ef46d950f8b030ed8212ad3d702f279ee88ec56b7f5","target":"record","created_at":"2026-05-18T01:34:06Z","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":"18d85672e9ac0d113943c6e7896d561e287903cc82c9dcf0e9c1b9c33a14bdf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-02T06:29:33Z","title_canon_sha256":"02f77237d839d075f70264f7dbfd673880394fcd8113cbd125fee8ae60a3171c"},"schema_version":"1.0","source":{"id":"1509.00569","kind":"arxiv","version":1}},"canonical_sha256":"dc120e7c4bf3e25385796e4700cbd0356b7e352993eb477dc56f51785e89779e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc120e7c4bf3e25385796e4700cbd0356b7e352993eb477dc56f51785e89779e","first_computed_at":"2026-05-18T01:34:06.805143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:06.805143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBrC3N7ZlY039V3x0LMtBJ/UA2t/u7lWXo7grbN9NCCMN9zty73C/RgUaO/BKvnahvU+n+EKL4kFYuw/bIW2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:06.805691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7690cb4724eece535970ef46d950f8b030ed8212ad3d702f279ee88ec56b7f5","sha256:14b803728f10d7cb8783fa26dd8d8fd75d23beeb2bef7fae67c4d119f7bdcac7"],"state_sha256":"34b01fd9b8aa884121033ebaa94f717cbbab817c26c925b12dd42d7a46226580"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmeFrLYee/x88rCTFHZ9R+8vj9i4RLUYjCBcsIqZKv6Xy/ZJE1mm3zfwsPRX1FPDQg2shahkxCS3Oy7iG7rwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:57:24.961841Z","bundle_sha256":"4587c94f74cdc8ec87bae31ecf0d34d592e4eb092baa47d4c8ef23791219016f"}}