{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JIYZ3YMLE4SBLK3HBHHALP4UMN","short_pith_number":"pith:JIYZ3YML","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"},"canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","source":{"kind":"arxiv","id":"1812.05316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05316","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05316v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05316","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"JIYZ3YMLE4SB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JIYZ3YMLE4SBLK3H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JIYZ3YML","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JIYZ3YMLE4SBLK3HBHHALP4UMN","target":"record","payload":{"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"},"canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","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"},"source_kind":"arxiv","source_id":"1812.05316","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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCugYBazHAmz0OdLd/0daP/s4ff8r/WQd894GJxAFeRN2HHYD44MCHlQQnb4UFed4UVm1vgw+axoeK0/loyHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:47:23.678903Z"},"content_sha256":"29076081d1a9de77c078ce9f4febcdfcde413e16ccad8c0991e2934391d9ccd0","schema_version":"1.0","event_id":"sha256:29076081d1a9de77c078ce9f4febcdfcde413e16ccad8c0991e2934391d9ccd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JIYZ3YMLE4SBLK3HBHHALP4UMN","target":"graph","payload":{"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"},"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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jm8EW4OBaZp5xl54TdILTSDkUutiJlQAMkwcm4PgamokjpmJcB47DcSoRiuSsQw+vJ0fIpPKJDQBOp/zjUsRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:47:23.679248Z"},"content_sha256":"e3d48ddb82b361a87974436e32ceaf671dbaaef9af3c914d5141af39df4ed675","schema_version":"1.0","event_id":"sha256:e3d48ddb82b361a87974436e32ceaf671dbaaef9af3c914d5141af39df4ed675"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/bundle.json","state_url":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/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-04T01:47:23Z","links":{"resolver":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN","bundle":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/bundle.json","state":"https://pith.science/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIYZ3YMLE4SBLK3HBHHALP4UMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JIYZ3YMLE4SBLK3HBHHALP4UMN","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":"369f3f6dbc82813cbbd780650adae86b47a29368256151f7e260800452724fa4","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:55:01Z","title_canon_sha256":"4f8c8ca9c79848680299aed1be76e7bcfe00e27cfe51cfe5c4a9da0a4c58ba06"},"schema_version":"1.0","source":{"id":"1812.05316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05316","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05316v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05316","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"JIYZ3YMLE4SB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JIYZ3YMLE4SBLK3H","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JIYZ3YML","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e3d48ddb82b361a87974436e32ceaf671dbaaef9af3c914d5141af39df4ed675","target":"graph","created_at":"2026-05-17T23:58:23Z","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":"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","authors_text":"Ademir Hujdurovi\\'c, Didem G\\\"oz\\\"upek, Martin Milani\\v{c}, T{\\i}naz Ekim","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:55:01Z","title":"Mind the Independence Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05316","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:29076081d1a9de77c078ce9f4febcdfcde413e16ccad8c0991e2934391d9ccd0","target":"record","created_at":"2026-05-17T23:58:23Z","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":"369f3f6dbc82813cbbd780650adae86b47a29368256151f7e260800452724fa4","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:55:01Z","title_canon_sha256":"4f8c8ca9c79848680299aed1be76e7bcfe00e27cfe51cfe5c4a9da0a4c58ba06"},"schema_version":"1.0","source":{"id":"1812.05316","kind":"arxiv","version":1}},"canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a319de18b272415ab6709ce05bf94636f29436d87797f136ab68e6b0540fc76","first_computed_at":"2026-05-17T23:58:23.812619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:23.812619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XfggVFgRpOHX4YHqCP8OU1FiVztA/6Q2Wl8jaFuGkuE8XTZD1H3zQ24SJDbsGBIlw9gBG9vvXQ5A/DFOX3drAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:23.813374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29076081d1a9de77c078ce9f4febcdfcde413e16ccad8c0991e2934391d9ccd0","sha256:e3d48ddb82b361a87974436e32ceaf671dbaaef9af3c914d5141af39df4ed675"],"state_sha256":"10c05c4d0aa437c5714b2fcd8423461a09047a598fb0c89f63bde5e6f08ab6f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KUKjK3f2gxn/jiUCD8QYmzQCutNSyxrY+K0Ri8bFMhC+1aTwN3RvzspaAUf08L4DE4kuJ389wRZepT+iXIqPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:47:23.681254Z","bundle_sha256":"d92e2ec945e114cab4ff9ef2792f13d1a924cdfcb4b107792663085dc2d02d43"}}