{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WMFKZSBHKARNRO5WULY7CAEO64","short_pith_number":"pith:WMFKZSBH","schema_version":"1.0","canonical_sha256":"b30aacc8275022d8bbb6a2f1f1008ef738df359ac0235cecec0f4d02d8e23c67","source":{"kind":"arxiv","id":"1606.06263","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.06263","created_at":"2026-05-18T01:12:15.254531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06263v1","created_at":"2026-05-18T01:12:15.254531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06263","created_at":"2026-05-18T01:12:15.254531+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMFKZSBHKARN","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMFKZSBHKARNRO5W","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMFKZSBH","created_at":"2026-05-18T12:30:48.956258+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/WMFKZSBHKARNRO5WULY7CAEO64","json":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64.json","graph_json":"https://pith.science/api/pith-number/WMFKZSBHKARNRO5WULY7CAEO64/graph.json","events_json":"https://pith.science/api/pith-number/WMFKZSBHKARNRO5WULY7CAEO64/events.json","paper":"https://pith.science/paper/WMFKZSBH"},"agent_actions":{"view_html":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64","download_json":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64.json","view_paper":"https://pith.science/paper/WMFKZSBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06263&json=true","fetch_graph":"https://pith.science/api/pith-number/WMFKZSBHKARNRO5WULY7CAEO64/graph.json","fetch_events":"https://pith.science/api/pith-number/WMFKZSBHKARNRO5WULY7CAEO64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/action/storage_attestation","attest_author":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/action/author_attestation","sign_citation":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/action/citation_signature","submit_replication":"https://pith.science/pith/WMFKZSBHKARNRO5WULY7CAEO64/action/replication_record"}},"created_at":"2026-05-18T01:12:15.254531+00:00","updated_at":"2026-05-18T01:12:15.254531+00:00"}