{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S6253W3QP6F4E2FSKMTCM7OAXS","short_pith_number":"pith:S6253W3Q","canonical_record":{"source":{"id":"1609.09134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-28T22:04:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f356e6c70c5ea0a806a3bb2290d097a71474a04fb18923612a61ffc789f28b19","abstract_canon_sha256":"66398e0e272a22f209bb49b13109744ecd83101f8a889273dffca506a965f2f8"},"schema_version":"1.0"},"canonical_sha256":"97b5dddb707f8bc268b25326267dc0bcb604685e742659fc3700da7517de59da","source":{"kind":"arxiv","id":"1609.09134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09134","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09134v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09134","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"S6253W3QP6F4","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"S6253W3QP6F4E2FS","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"S6253W3Q","created_at":"2026-07-05T00:16:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S6253W3QP6F4E2FSKMTCM7OAXS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-28T22:04:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f356e6c70c5ea0a806a3bb2290d097a71474a04fb18923612a61ffc789f28b19","abstract_canon_sha256":"66398e0e272a22f209bb49b13109744ecd83101f8a889273dffca506a965f2f8"},"schema_version":"1.0"},"canonical_sha256":"97b5dddb707f8bc268b25326267dc0bcb604685e742659fc3700da7517de59da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:29.040633Z","signature_b64":"8yJYssouth88ejtS5Woxv9LvCyY9FRFClGNz0+ug+6QkQ8AzeZeourdwewENDHM6/DOzsrjGSW9sFZCPxZZjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b5dddb707f8bc268b25326267dc0bcb604685e742659fc3700da7517de59da","last_reissued_at":"2026-07-05T00:16:29.040143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:29.040143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09134","source_version":2,"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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27c1PZ8poI21cYPcQTdBS/Tto5BYCATbIP6grW5xXpEddpT7GcaIp5QqLFultrcYDPpF4u4wkcQk/gk6ASAWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:48:15.063081Z"},"content_sha256":"11e5263a6d8cc3b35f4fe230f50038d4825425e5f517aa7c1f30c50eb36bf73a","schema_version":"1.0","event_id":"sha256:11e5263a6d8cc3b35f4fe230f50038d4825425e5f517aa7c1f30c50eb36bf73a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S6253W3QP6F4E2FSKMTCM7OAXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Independent sets near the lower bound in bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bernard Lidicky, Zdenek Dvorak","submitted_at":"2016-09-28T22:04:14Z","abstract_excerpt":"By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an indepdendent set of size at least n/Delta+k has a kernel of size O(k)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09134","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1609.09134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:16:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vo7tXcc8a1gm4x9F1ejg7Qa8tUgkVgz590ILDu1SmEs1va9SEAQRWWR944uAzch7GJX0bNtPVwDtsqsLJ28cDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:48:15.063588Z"},"content_sha256":"c484c7e67fd5f6a1afbd38d1a421bb7867b6bf7bee2a6777ab0c164ad742eff2","schema_version":"1.0","event_id":"sha256:c484c7e67fd5f6a1afbd38d1a421bb7867b6bf7bee2a6777ab0c164ad742eff2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6253W3QP6F4E2FSKMTCM7OAXS/bundle.json","state_url":"https://pith.science/pith/S6253W3QP6F4E2FSKMTCM7OAXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6253W3QP6F4E2FSKMTCM7OAXS/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-08-11T01:48:15Z","links":{"resolver":"https://pith.science/pith/S6253W3QP6F4E2FSKMTCM7OAXS","bundle":"https://pith.science/pith/S6253W3QP6F4E2FSKMTCM7OAXS/bundle.json","state":"https://pith.science/pith/S6253W3QP6F4E2FSKMTCM7OAXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6253W3QP6F4E2FSKMTCM7OAXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S6253W3QP6F4E2FSKMTCM7OAXS","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":"66398e0e272a22f209bb49b13109744ecd83101f8a889273dffca506a965f2f8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-28T22:04:14Z","title_canon_sha256":"f356e6c70c5ea0a806a3bb2290d097a71474a04fb18923612a61ffc789f28b19"},"schema_version":"1.0","source":{"id":"1609.09134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09134","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09134v2","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09134","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_12","alias_value":"S6253W3QP6F4","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_16","alias_value":"S6253W3QP6F4E2FS","created_at":"2026-07-05T00:16:29Z"},{"alias_kind":"pith_short_8","alias_value":"S6253W3Q","created_at":"2026-07-05T00:16:29Z"}],"graph_snapshots":[{"event_id":"sha256:c484c7e67fd5f6a1afbd38d1a421bb7867b6bf7bee2a6777ab0c164ad742eff2","target":"graph","created_at":"2026-07-05T00:16:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1609.09134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs with independence number close to this bound, and use it to show that the problem of deciding whether such a graph has an indepdendent set of size at least n/Delta+k has a kernel of size O(k).","authors_text":"Bernard Lidicky, Zdenek Dvorak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-28T22:04:14Z","title":"Independent sets near the lower bound in bounded degree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09134","kind":"arxiv","version":2},"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:11e5263a6d8cc3b35f4fe230f50038d4825425e5f517aa7c1f30c50eb36bf73a","target":"record","created_at":"2026-07-05T00:16:29Z","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":"66398e0e272a22f209bb49b13109744ecd83101f8a889273dffca506a965f2f8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-28T22:04:14Z","title_canon_sha256":"f356e6c70c5ea0a806a3bb2290d097a71474a04fb18923612a61ffc789f28b19"},"schema_version":"1.0","source":{"id":"1609.09134","kind":"arxiv","version":2}},"canonical_sha256":"97b5dddb707f8bc268b25326267dc0bcb604685e742659fc3700da7517de59da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b5dddb707f8bc268b25326267dc0bcb604685e742659fc3700da7517de59da","first_computed_at":"2026-07-05T00:16:29.040143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:29.040143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8yJYssouth88ejtS5Woxv9LvCyY9FRFClGNz0+ug+6QkQ8AzeZeourdwewENDHM6/DOzsrjGSW9sFZCPxZZjCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:29.040633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11e5263a6d8cc3b35f4fe230f50038d4825425e5f517aa7c1f30c50eb36bf73a","sha256:c484c7e67fd5f6a1afbd38d1a421bb7867b6bf7bee2a6777ab0c164ad742eff2"],"state_sha256":"e7aa228dd557e38735cb7e7445be145f644a2198a305786c5f7fba01f5155bf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FLj5lACuW2hsb1z6Z+dHvl8dR7gRAF95GDN4+cGkxjY9IJr4cM6oeFQ6Q7ty5HqyNS1tQIt/WoJ6RnRd2BbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:48:15.067164Z","bundle_sha256":"03c6b441ef039a2d5ce7cf5ef3119246b0defd545fdaa984ce6e3d5560d8a61b"}}