{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6N3X2RSQOONYJYPHI3O6XFYCAA","short_pith_number":"pith:6N3X2RSQ","canonical_record":{"source":{"id":"1408.4046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"4d01b56adfec26ffc1034e5fda4c77d0ee90be52a970542dbf62b1b7e67d609a","abstract_canon_sha256":"270edb434a095ad2c934efa3a7a3a604b3f9a3b8656449a85633f8fef6fca7c6"},"schema_version":"1.0"},"canonical_sha256":"f3777d4650739b84e1e746ddeb9702003291b4efd55653f60323a81d97a4a1d7","source":{"kind":"arxiv","id":"1408.4046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4046","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4046v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4046","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"6N3X2RSQOONY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6N3X2RSQOONYJYPH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6N3X2RSQ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6N3X2RSQOONYJYPHI3O6XFYCAA","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:42:30Z","cross_cats_sorted":[],"title_canon_sha256":"4d01b56adfec26ffc1034e5fda4c77d0ee90be52a970542dbf62b1b7e67d609a","abstract_canon_sha256":"270edb434a095ad2c934efa3a7a3a604b3f9a3b8656449a85633f8fef6fca7c6"},"schema_version":"1.0"},"canonical_sha256":"f3777d4650739b84e1e746ddeb9702003291b4efd55653f60323a81d97a4a1d7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.373130Z","signature_b64":"zWTJyIMt3UWNkUQIucyiSlXSjqDqEOkz46aEgW+eNRNwoP7UdjoEsoPkAZ3cqxChYSL/BgYT/5sh7Zt/yGauBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3777d4650739b84e1e746ddeb9702003291b4efd55653f60323a81d97a4a1d7","last_reissued_at":"2026-05-18T02:44:57.372702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.372702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4046","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uX7trV11d+DHpv4gTObCTqy7lNwlGrsbBuyz+a37X+Q3VRw9iwxKWohLifsb7QTPG33cim1o++rm0v+91sPBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:29:52.450083Z"},"content_sha256":"bbcee9f515bc62abfcee916f78e0b2e78bcea7168b1782971eb1e10b3588da95","schema_version":"1.0","event_id":"sha256:bbcee9f515bc62abfcee916f78e0b2e78bcea7168b1782971eb1e10b3588da95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6N3X2RSQOONYJYPHI3O6XFYCAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Surface embedding of $(n,k)$-extendable 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":"2014-08-18T15:42:30Z","abstract_excerpt":"This paper is concerned with the surface embedding of matching extendable graphs. There are two directions extending the theory of perfect matchings, that is, matching extendability and factor-criticality. In solving a problem posed by Plummer, Dean (The matching extendability of surfaces, J. Combin. Theory Ser. B 54 (1992), 133--141) established the fascinating formula for the minimum number $k= \\mu (\\Sigma) $ such that every $\\Sigma$-embeddable graph is not $k$-extendable. Su and Zhang, Plummer and Zha found the minimum number $n=\\rho(\\Sigma)$ such that every $\\Sigma$-embeddable graph is not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4046","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MIFVM6ys8bBXCjTAqzmdhy/e66Md14pSr5Rvw4Oz4vHb6aRrt/s8npxPvg8dKZ9u9t8t6RxHDcvP2pbwQGkzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:29:52.450464Z"},"content_sha256":"640e21cdc6e75c6c8325fa415c25c7b99a71c88f42872fb5dfbd7ddc177e9e97","schema_version":"1.0","event_id":"sha256:640e21cdc6e75c6c8325fa415c25c7b99a71c88f42872fb5dfbd7ddc177e9e97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/bundle.json","state_url":"https://pith.science/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/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-01T23:29:52Z","links":{"resolver":"https://pith.science/pith/6N3X2RSQOONYJYPHI3O6XFYCAA","bundle":"https://pith.science/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/bundle.json","state":"https://pith.science/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6N3X2RSQOONYJYPHI3O6XFYCAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6N3X2RSQOONYJYPHI3O6XFYCAA","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":"270edb434a095ad2c934efa3a7a3a604b3f9a3b8656449a85633f8fef6fca7c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:42:30Z","title_canon_sha256":"4d01b56adfec26ffc1034e5fda4c77d0ee90be52a970542dbf62b1b7e67d609a"},"schema_version":"1.0","source":{"id":"1408.4046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4046","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4046v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4046","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"6N3X2RSQOONY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6N3X2RSQOONYJYPH","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6N3X2RSQ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:640e21cdc6e75c6c8325fa415c25c7b99a71c88f42872fb5dfbd7ddc177e9e97","target":"graph","created_at":"2026-05-18T02:44:57Z","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":"This paper is concerned with the surface embedding of matching extendable graphs. There are two directions extending the theory of perfect matchings, that is, matching extendability and factor-criticality. In solving a problem posed by Plummer, Dean (The matching extendability of surfaces, J. Combin. Theory Ser. B 54 (1992), 133--141) established the fascinating formula for the minimum number $k= \\mu (\\Sigma) $ such that every $\\Sigma$-embeddable graph is not $k$-extendable. Su and Zhang, Plummer and Zha found the minimum number $n=\\rho(\\Sigma)$ such that every $\\Sigma$-embeddable graph is not","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":"2014-08-18T15:42:30Z","title":"Surface embedding of $(n,k)$-extendable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4046","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:bbcee9f515bc62abfcee916f78e0b2e78bcea7168b1782971eb1e10b3588da95","target":"record","created_at":"2026-05-18T02:44:57Z","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":"270edb434a095ad2c934efa3a7a3a604b3f9a3b8656449a85633f8fef6fca7c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:42:30Z","title_canon_sha256":"4d01b56adfec26ffc1034e5fda4c77d0ee90be52a970542dbf62b1b7e67d609a"},"schema_version":"1.0","source":{"id":"1408.4046","kind":"arxiv","version":1}},"canonical_sha256":"f3777d4650739b84e1e746ddeb9702003291b4efd55653f60323a81d97a4a1d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3777d4650739b84e1e746ddeb9702003291b4efd55653f60323a81d97a4a1d7","first_computed_at":"2026-05-18T02:44:57.372702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:57.372702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zWTJyIMt3UWNkUQIucyiSlXSjqDqEOkz46aEgW+eNRNwoP7UdjoEsoPkAZ3cqxChYSL/BgYT/5sh7Zt/yGauBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:57.373130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbcee9f515bc62abfcee916f78e0b2e78bcea7168b1782971eb1e10b3588da95","sha256:640e21cdc6e75c6c8325fa415c25c7b99a71c88f42872fb5dfbd7ddc177e9e97"],"state_sha256":"36ef51aa8c99ed8334f1c6bcebe24280512d668809139c88dd4433184c374960"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HgwpnyfVF40bIEt4xnRUcbNA0vxnsdgQeCUtoe6Pup/EFEObl5jYoM/4t+vhClbjOSdzg1KsdPCS9xb6BZ6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:29:52.452446Z","bundle_sha256":"b2a3648862f6192001d2e84d7795d2587876e02b97f49bc7ffa6b633ac5cd8d6"}}