{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FFOQS3FJEOLY6T4DFORDISR5LQ","short_pith_number":"pith:FFOQS3FJ","canonical_record":{"source":{"id":"2001.11997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-31T18:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"1ac7feea94aea6ed4b4a56eaebb080ab18941aa0d638ac9554727050465ea8b7","abstract_canon_sha256":"47ce8fa5d9b2c9f6d08764479917531b7acd37ca44e63e586271c2083e4f6ce7"},"schema_version":"1.0"},"canonical_sha256":"295d096ca923978f4f832ba2344a3d5c3ada603e14bbd81ec604ebcc82c5473b","source":{"kind":"arxiv","id":"2001.11997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11997","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11997v1","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11997","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"FFOQS3FJEOLY","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_16","alias_value":"FFOQS3FJEOLY6T4D","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_8","alias_value":"FFOQS3FJ","created_at":"2026-07-05T00:37:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FFOQS3FJEOLY6T4DFORDISR5LQ","target":"record","payload":{"canonical_record":{"source":{"id":"2001.11997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-31T18:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"1ac7feea94aea6ed4b4a56eaebb080ab18941aa0d638ac9554727050465ea8b7","abstract_canon_sha256":"47ce8fa5d9b2c9f6d08764479917531b7acd37ca44e63e586271c2083e4f6ce7"},"schema_version":"1.0"},"canonical_sha256":"295d096ca923978f4f832ba2344a3d5c3ada603e14bbd81ec604ebcc82c5473b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:37:35.601961Z","signature_b64":"dIEfV2dHAwPzDeur+XxD7dweN5cIVRGBq0bKiaaRHGOQMa5jwJqwD3hSFzgUe6XvYv9NX40dGjvplcHvIPzgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"295d096ca923978f4f832ba2344a3d5c3ada603e14bbd81ec604ebcc82c5473b","last_reissued_at":"2026-07-05T00:37:35.601582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:37:35.601582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.11997","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-07-05T00:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9QByV8HabHEIm0pXiHRYeiuIFVDULPcrkS1tFWY5g2VKKEcLH/UrIc80JS/Op0o/+xfeYoLaPgIv/56/0FqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:14:07.703691Z"},"content_sha256":"698772da23f466893113e2f37969ed0bc37bb042ab14121cd10332e629b8831b","schema_version":"1.0","event_id":"sha256:698772da23f466893113e2f37969ed0bc37bb042ab14121cd10332e629b8831b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FFOQS3FJEOLY6T4DFORDISR5LQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ultimate greedy approximation of independent sets in subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathieu Mari, Nan Zhi, Piotr Krysta","submitted_at":"2020-01-31T18:39:58Z","abstract_excerpt":"We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy algorithm for this problem. This algorithm iteratively chooses a minimum degree vertex in the graph, adds it to the solution and removes its neighbors, until the remaining graph is empty. The approximation ratios of this algorithm have been very widely studied, where it is augmented with an advice that tells the greedy which minimum degree vertex to choose if it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11997","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.11997/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:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4wmPVMsqrkR1aazL4L7Uv6iehsITOI3qOwjLU6WhH22vG5RfrmycRV9OT3mO9YDlVVhD66X+JImlDr0IiIiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:14:07.704464Z"},"content_sha256":"7d37ccc19d6b40fd305894622378beadfa41031247d4f40ffc22e9ac2c3ccf4b","schema_version":"1.0","event_id":"sha256:7d37ccc19d6b40fd305894622378beadfa41031247d4f40ffc22e9ac2c3ccf4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/bundle.json","state_url":"https://pith.science/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/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-07-05T14:14:07Z","links":{"resolver":"https://pith.science/pith/FFOQS3FJEOLY6T4DFORDISR5LQ","bundle":"https://pith.science/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/bundle.json","state":"https://pith.science/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFOQS3FJEOLY6T4DFORDISR5LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FFOQS3FJEOLY6T4DFORDISR5LQ","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":"47ce8fa5d9b2c9f6d08764479917531b7acd37ca44e63e586271c2083e4f6ce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-31T18:39:58Z","title_canon_sha256":"1ac7feea94aea6ed4b4a56eaebb080ab18941aa0d638ac9554727050465ea8b7"},"schema_version":"1.0","source":{"id":"2001.11997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.11997","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"2001.11997v1","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11997","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"FFOQS3FJEOLY","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_16","alias_value":"FFOQS3FJEOLY6T4D","created_at":"2026-07-05T00:37:35Z"},{"alias_kind":"pith_short_8","alias_value":"FFOQS3FJ","created_at":"2026-07-05T00:37:35Z"}],"graph_snapshots":[{"event_id":"sha256:7d37ccc19d6b40fd305894622378beadfa41031247d4f40ffc22e9ac2c3ccf4b","target":"graph","created_at":"2026-07-05T00:37:35Z","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/2001.11997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy algorithm for this problem. This algorithm iteratively chooses a minimum degree vertex in the graph, adds it to the solution and removes its neighbors, until the remaining graph is empty. The approximation ratios of this algorithm have been very widely studied, where it is augmented with an advice that tells the greedy which minimum degree vertex to choose if it","authors_text":"Mathieu Mari, Nan Zhi, Piotr Krysta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-31T18:39:58Z","title":"Ultimate greedy approximation of independent sets in subcubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11997","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:698772da23f466893113e2f37969ed0bc37bb042ab14121cd10332e629b8831b","target":"record","created_at":"2026-07-05T00:37:35Z","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":"47ce8fa5d9b2c9f6d08764479917531b7acd37ca44e63e586271c2083e4f6ce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-31T18:39:58Z","title_canon_sha256":"1ac7feea94aea6ed4b4a56eaebb080ab18941aa0d638ac9554727050465ea8b7"},"schema_version":"1.0","source":{"id":"2001.11997","kind":"arxiv","version":1}},"canonical_sha256":"295d096ca923978f4f832ba2344a3d5c3ada603e14bbd81ec604ebcc82c5473b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"295d096ca923978f4f832ba2344a3d5c3ada603e14bbd81ec604ebcc82c5473b","first_computed_at":"2026-07-05T00:37:35.601582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:37:35.601582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dIEfV2dHAwPzDeur+XxD7dweN5cIVRGBq0bKiaaRHGOQMa5jwJqwD3hSFzgUe6XvYv9NX40dGjvplcHvIPzgAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:37:35.601961Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.11997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:698772da23f466893113e2f37969ed0bc37bb042ab14121cd10332e629b8831b","sha256:7d37ccc19d6b40fd305894622378beadfa41031247d4f40ffc22e9ac2c3ccf4b"],"state_sha256":"15589fc0f5c07942ada6632a236cda75949a668bf34341634b7a21f26f689498"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHVnX6sQbTWPrIbZp3TXGwldf1PpcuRkgentOLvdxF7Wu1BYO51I2vvF0bOyPHZUfFQSOp8LP5xOkbiICmarCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:14:07.708483Z","bundle_sha256":"ec71860eaabc0c553cf7215b154d5a839f4c94ea767d126d743a377cef148f60"}}