{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RQ2XAWEUT6CXMOUUSOKJSS3LUB","short_pith_number":"pith:RQ2XAWEU","schema_version":"1.0","canonical_sha256":"8c357058949f85763a949394994b6ba04731a6049264469b28a42d6ddcee46e2","source":{"kind":"arxiv","id":"1808.06666","version":1},"attestation_state":"computed","paper":{"title":"Stability for maximal independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Jinyoung Park","submitted_at":"2018-08-20T19:32:14Z","abstract_excerpt":"Answering questions of Y. Rabinovich, we prove \"stability\" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions)."},"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":"1808.06666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-20T19:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"00a3dace16c2861bb3206c189e815686dc3ec6a3448a3eab136b668631cb6d43","abstract_canon_sha256":"ee7394c01a00598c2ae501491bbe041b78f5f7ec95e64ebfb0d2cf0d4dd32383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:39.476892Z","signature_b64":"fxZGjrGQxK4apFf314JRXYftOxG+gT8whMWW1XGHX4Zie79YKWq0nh+VrRNtidmZ2r6iFpWb3C2hNFekv+whAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c357058949f85763a949394994b6ba04731a6049264469b28a42d6ddcee46e2","last_reissued_at":"2026-05-18T00:07:39.476399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:39.476399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability for maximal independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeff Kahn, Jinyoung Park","submitted_at":"2018-08-20T19:32:14Z","abstract_excerpt":"Answering questions of Y. Rabinovich, we prove \"stability\" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06666","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":"1808.06666","created_at":"2026-05-18T00:07:39.476476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06666v1","created_at":"2026-05-18T00:07:39.476476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06666","created_at":"2026-05-18T00:07:39.476476+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQ2XAWEUT6CX","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQ2XAWEUT6CXMOUU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQ2XAWEU","created_at":"2026-05-18T12:32:50.500415+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/RQ2XAWEUT6CXMOUUSOKJSS3LUB","json":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB.json","graph_json":"https://pith.science/api/pith-number/RQ2XAWEUT6CXMOUUSOKJSS3LUB/graph.json","events_json":"https://pith.science/api/pith-number/RQ2XAWEUT6CXMOUUSOKJSS3LUB/events.json","paper":"https://pith.science/paper/RQ2XAWEU"},"agent_actions":{"view_html":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB","download_json":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB.json","view_paper":"https://pith.science/paper/RQ2XAWEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06666&json=true","fetch_graph":"https://pith.science/api/pith-number/RQ2XAWEUT6CXMOUUSOKJSS3LUB/graph.json","fetch_events":"https://pith.science/api/pith-number/RQ2XAWEUT6CXMOUUSOKJSS3LUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB/action/storage_attestation","attest_author":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB/action/author_attestation","sign_citation":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB/action/citation_signature","submit_replication":"https://pith.science/pith/RQ2XAWEUT6CXMOUUSOKJSS3LUB/action/replication_record"}},"created_at":"2026-05-18T00:07:39.476476+00:00","updated_at":"2026-05-18T00:07:39.476476+00:00"}