{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WMFKZSBHKARNRO5WULY7CAEO64","short_pith_number":"pith:WMFKZSBH","canonical_record":{"source":{"id":"1606.06263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"95b8d34d468497e607ea75fa0bc6f6b1b43f545e27b18806d7e4e3b4c39cdf7b","abstract_canon_sha256":"9cd5727296ef2107f51cda3b3ff5a810661ab4345735a6b87d95e1eda4770198"},"schema_version":"1.0"},"canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","source":{"kind":"arxiv","id":"1606.06263","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06263","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06263v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06263","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"WMFKZSBHKARN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WMFKZSBHKARNRO5W","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WMFKZSBH","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WMFKZSBHKARNRO5WULY7CAEO64","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:32:18Z","cross_cats_sorted":[],"title_canon_sha256":"95b8d34d468497e607ea75fa0bc6f6b1b43f545e27b18806d7e4e3b4c39cdf7b","abstract_canon_sha256":"9cd5727296ef2107f51cda3b3ff5a810661ab4345735a6b87d95e1eda4770198"},"schema_version":"1.0"},"canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.254829Z","signature_b64":"lsn5+TOxTqRtEaHjzN6os24Y1df9YvAEqQgmwI7gDWI/OaRqpeXX9DZ+UMTobGSjJK9YvnWwgVE0m3TVhD/dBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","last_reissued_at":"2026-05-18T01:12:15.254478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.254478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06263","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:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzCLrUiHCPdMfZPGpVzccYBMKIvRcEjji+U0sS1nKi8rHRwGgaCJ3bjc00meJqDd12GWvb74+xGGnbzY8Ra8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:28:24.590289Z"},"content_sha256":"e579984abbc09f38a5f0f5f3f175243d646a50b8b32ab16e99c0d709763162ff","schema_version":"1.0","event_id":"sha256:e579984abbc09f38a5f0f5f3f175243d646a50b8b32ab16e99c0d709763162ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WMFKZSBHKARNRO5WULY7CAEO64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blocker size via matching minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nikola Yolov","submitted_at":"2016-06-20T19:32:18Z","abstract_excerpt":"Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$ disjoint edges. A graph with an induced copy of $kK_2$ contains at least $2^k$ maximal independent sets. The other direction was established in a series of papers finally yielding $i(G) \\le (n/k)^{2k}$ for a graph $G$ without an induced $(k+1)K_2$. Alekseev proved that $i(G)$ is at most the number of induced matchings of $G$.\n  This work generalises the aforeme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06263","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:12:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Dh2boUETR000gUpi4oJ5dB2apkj619MD6/NdBd7wuN1Oby5PnPrgqI5UY8Z8AZnIwsLhg/oinyu5y+xG36GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:28:24.590637Z"},"content_sha256":"0fcfb23d197a2834834b118e053e0174e87880a33629ea6de89d4cdeb59e4781","schema_version":"1.0","event_id":"sha256:0fcfb23d197a2834834b118e053e0174e87880a33629ea6de89d4cdeb59e4781"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/bundle.json","state_url":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMFKZSBHKARNRO5WULY7CAEO64/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-27T20:28:24Z","links":{"resolver":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64","bundle":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/bundle.json","state":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMFKZSBHKARNRO5WULY7CAEO64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WMFKZSBHKARNRO5WULY7CAEO64","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":"9cd5727296ef2107f51cda3b3ff5a810661ab4345735a6b87d95e1eda4770198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:32:18Z","title_canon_sha256":"95b8d34d468497e607ea75fa0bc6f6b1b43f545e27b18806d7e4e3b4c39cdf7b"},"schema_version":"1.0","source":{"id":"1606.06263","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06263","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06263v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06263","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"WMFKZSBHKARN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WMFKZSBHKARNRO5W","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WMFKZSBH","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:0fcfb23d197a2834834b118e053e0174e87880a33629ea6de89d4cdeb59e4781","target":"graph","created_at":"2026-05-18T01:12:15Z","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":"Finding the maximum number of maximal independent sets in an $n$-vertex graph $G$, $i(G)$, from a restricted class is an extensively studied problem. Let $kK_2$ denote the matching of size $k$, that is a graph with $2k$ vertices and $k$ disjoint edges. A graph with an induced copy of $kK_2$ contains at least $2^k$ maximal independent sets. The other direction was established in a series of papers finally yielding $i(G) \\le (n/k)^{2k}$ for a graph $G$ without an induced $(k+1)K_2$. Alekseev proved that $i(G)$ is at most the number of induced matchings of $G$.\n  This work generalises the aforeme","authors_text":"Nikola Yolov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:32:18Z","title":"Blocker size via matching minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06263","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:e579984abbc09f38a5f0f5f3f175243d646a50b8b32ab16e99c0d709763162ff","target":"record","created_at":"2026-05-18T01:12:15Z","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":"9cd5727296ef2107f51cda3b3ff5a810661ab4345735a6b87d95e1eda4770198","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:32:18Z","title_canon_sha256":"95b8d34d468497e607ea75fa0bc6f6b1b43f545e27b18806d7e4e3b4c39cdf7b"},"schema_version":"1.0","source":{"id":"1606.06263","kind":"arxiv","version":1}},"canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","first_computed_at":"2026-05-18T01:12:15.254478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:15.254478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsn5+TOxTqRtEaHjzN6os24Y1df9YvAEqQgmwI7gDWI/OaRqpeXX9DZ+UMTobGSjJK9YvnWwgVE0m3TVhD/dBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:15.254829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06263","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e579984abbc09f38a5f0f5f3f175243d646a50b8b32ab16e99c0d709763162ff","sha256:0fcfb23d197a2834834b118e053e0174e87880a33629ea6de89d4cdeb59e4781"],"state_sha256":"7b494926353e7985fe91de11a1621501f9e8a8362fc65a493683b101699c7d16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0tNSk+qF9VmgDwZFI9Gap8Yu1s0iaU/Km1u3Q9x9TSjBPugrQQKa+y1/ewU48T7v1MxUqTrppH1bg3250VdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:28:24.592435Z","bundle_sha256":"774e4f3cee783a314a5e8bba6775423160ded3da6d48105bc043284994f31d91"}}