{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JIYZ3YMLE4SBLK3HBHHALP4UMN","short_pith_number":"pith:JIYZ3YML","schema_version":"1.0","canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","source":{"kind":"arxiv","id":"1812.05316","version":1},"attestation_state":"computed","paper":{"title":"Mind the Independence Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Didem G\\\"oz\\\"upek, Martin Milani\\v{c}, T{\\i}naz Ekim","submitted_at":"2018-12-13T08:55:01Z","abstract_excerpt":"The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set.\n  We investigate the independence gap of a graph from structural and algorithmic points of view, with a focus on classes of perfect graphs. Generalizing results on well-covered graphs due to Dean and Zito (1994) and Hujdurovi\\'c et al. (2018), we express the independence gap of a perfect graph in terms of clique partitions and use this characterization to develop a poly"},"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":"1812.05316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:55:01Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"4f8c8ca9c79848680299aed1be76e7bcfe00e27cfe51cfe5c4a9da0a4c58ba06","abstract_canon_sha256":"369f3f6dbc82813cbbd780650adae86b47a29368256151f7e260800452724fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:23.813374Z","signature_b64":"XfggVFgRpOHX4YHqCP8OU1FiVztA/6Q2Wl8jaFuGkuE8XTZD1H3zQ24SJDbsGBIlw9gBG9vvXQ5A/DFOX3drAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","last_reissued_at":"2026-05-17T23:58:23.812619Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:23.812619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mind the Independence Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Didem G\\\"oz\\\"upek, Martin Milani\\v{c}, T{\\i}naz Ekim","submitted_at":"2018-12-13T08:55:01Z","abstract_excerpt":"The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set.\n  We investigate the independence gap of a graph from structural and algorithmic points of view, with a focus on classes of perfect graphs. Generalizing results on well-covered graphs due to Dean and Zito (1994) and Hujdurovi\\'c et al. (2018), we express the independence gap of a perfect graph in terms of clique partitions and use this characterization to develop a poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05316","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":"1812.05316","created_at":"2026-05-17T23:58:23.812750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05316v1","created_at":"2026-05-17T23:58:23.812750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05316","created_at":"2026-05-17T23:58:23.812750+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIYZ3YMLE4SB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIYZ3YMLE4SBLK3H","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIYZ3YML","created_at":"2026-05-18T12:32:31.084164+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/JIYZ3YMLE4SBLK3HBHHALP4UMN","json":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN.json","graph_json":"https://pith.science/api/pith-number/JIYZ3YMLE4SBLK3HBHHALP4UMN/graph.json","events_json":"https://pith.science/api/pith-number/JIYZ3YMLE4SBLK3HBHHALP4UMN/events.json","paper":"https://pith.science/paper/JIYZ3YML"},"agent_actions":{"view_html":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN","download_json":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN.json","view_paper":"https://pith.science/paper/JIYZ3YML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05316&json=true","fetch_graph":"https://pith.science/api/pith-number/JIYZ3YMLE4SBLK3HBHHALP4UMN/graph.json","fetch_events":"https://pith.science/api/pith-number/JIYZ3YMLE4SBLK3HBHHALP4UMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/action/storage_attestation","attest_author":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/action/author_attestation","sign_citation":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/action/citation_signature","submit_replication":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/action/replication_record"}},"created_at":"2026-05-17T23:58:23.812750+00:00","updated_at":"2026-05-17T23:58:23.812750+00:00"}