{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W7PRK4D52BHZ3WENVH3XU5TCZQ","short_pith_number":"pith:W7PRK4D5","canonical_record":{"source":{"id":"1308.1351","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-06T17:08:50Z","cross_cats_sorted":[],"title_canon_sha256":"8e2de0c00b92925162c28cebe04632bee2fcc028fc53646ae5f09cd821bc19d6","abstract_canon_sha256":"ccf1afafc3f1927020c5212f090056f940623cdf9c2c7c8dc2e9a865fa19fe7a"},"schema_version":"1.0"},"canonical_sha256":"b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e","source":{"kind":"arxiv","id":"1308.1351","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1351","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1351v4","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1351","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"W7PRK4D52BHZ","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_16","alias_value":"W7PRK4D52BHZ3WEN","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_8","alias_value":"W7PRK4D5","created_at":"2026-07-05T04:32:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W7PRK4D52BHZ3WENVH3XU5TCZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1308.1351","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-06T17:08:50Z","cross_cats_sorted":[],"title_canon_sha256":"8e2de0c00b92925162c28cebe04632bee2fcc028fc53646ae5f09cd821bc19d6","abstract_canon_sha256":"ccf1afafc3f1927020c5212f090056f940623cdf9c2c7c8dc2e9a865fa19fe7a"},"schema_version":"1.0"},"canonical_sha256":"b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:35.759934Z","signature_b64":"9XtLRtiaQMoz15teKn0aoTKuETjmpS9LuB4gNlK9NO7OgSTeR2NUmdtkQczMAyprzcM/We/zHzDNRFVO/SW6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e","last_reissued_at":"2026-07-05T04:32:35.759520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:35.759520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.1351","source_version":4,"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-05T04:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gUEU+JYYdO/C3p5Gp04Qs9Jtxnkpstem1DQGeZg11nQEks3L73NcSwTRwCd3bPHJl9KLR9NETJyAlb9DZsHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T22:35:46.063052Z"},"content_sha256":"c419b763855795198afa496d99212bece438e32960e192f0968b3fba39e7c9a0","schema_version":"1.0","event_id":"sha256:c419b763855795198afa496d99212bece438e32960e192f0968b3fba39e7c9a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W7PRK4D52BHZ3WENVH3XU5TCZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Davis Issac, Ragesh Jaiswal","submitted_at":"2013-08-06T17:08:50Z","abstract_excerpt":"We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1351","kind":"arxiv","version":4},"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/1308.1351/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-05T04:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuIxvpcmd/59voYcRRvvBw2xPt/7JS728b1CkR5BGYRRddQjxkgWD1x/XqeeIxOWefg7V6TxCLNhEio78M77AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T22:35:46.063387Z"},"content_sha256":"439b73d24f91a846b7365b2c36fb92e1750b7ab4f9249b3fdf6d279a1b597ca9","schema_version":"1.0","event_id":"sha256:439b73d24f91a846b7365b2c36fb92e1750b7ab4f9249b3fdf6d279a1b597ca9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/bundle.json","state_url":"https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/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-14T22:35:46Z","links":{"resolver":"https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ","bundle":"https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/bundle.json","state":"https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W7PRK4D52BHZ3WENVH3XU5TCZQ","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":"ccf1afafc3f1927020c5212f090056f940623cdf9c2c7c8dc2e9a865fa19fe7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-06T17:08:50Z","title_canon_sha256":"8e2de0c00b92925162c28cebe04632bee2fcc028fc53646ae5f09cd821bc19d6"},"schema_version":"1.0","source":{"id":"1308.1351","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1351","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1351v4","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1351","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"W7PRK4D52BHZ","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_16","alias_value":"W7PRK4D52BHZ3WEN","created_at":"2026-07-05T04:32:35Z"},{"alias_kind":"pith_short_8","alias_value":"W7PRK4D5","created_at":"2026-07-05T04:32:35Z"}],"graph_snapshots":[{"event_id":"sha256:439b73d24f91a846b7365b2c36fb92e1750b7ab4f9249b3fdf6d279a1b597ca9","target":"graph","created_at":"2026-07-05T04:32: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/1308.1351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an $O^*(1.0821^n)$-time, polynomial space algorithm for computing Maximum Independent Set in graphs with bounded degree 3. This improves all the previous running time bounds known for the problem.","authors_text":"Davis Issac, Ragesh Jaiswal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-06T17:08:50Z","title":"An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1351","kind":"arxiv","version":4},"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:c419b763855795198afa496d99212bece438e32960e192f0968b3fba39e7c9a0","target":"record","created_at":"2026-07-05T04:32: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":"ccf1afafc3f1927020c5212f090056f940623cdf9c2c7c8dc2e9a865fa19fe7a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-06T17:08:50Z","title_canon_sha256":"8e2de0c00b92925162c28cebe04632bee2fcc028fc53646ae5f09cd821bc19d6"},"schema_version":"1.0","source":{"id":"1308.1351","kind":"arxiv","version":4}},"canonical_sha256":"b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e","first_computed_at":"2026-07-05T04:32:35.759520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:32:35.759520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XtLRtiaQMoz15teKn0aoTKuETjmpS9LuB4gNlK9NO7OgSTeR2NUmdtkQczMAyprzcM/We/zHzDNRFVO/SW6Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:32:35.759934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1351","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c419b763855795198afa496d99212bece438e32960e192f0968b3fba39e7c9a0","sha256:439b73d24f91a846b7365b2c36fb92e1750b7ab4f9249b3fdf6d279a1b597ca9"],"state_sha256":"587bbcc9e6dd5f2cd581e03119db17af6507de5dce39a3de7ed5c780f28292bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPvgsxm24Xsmj+UCbykvdcmoUs3s04Nino2XIbw6Iy7aXphe0BKuFInV6IgTERkL/3V7jZ7ff6TI+dT3VQK/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T22:35:46.066702Z","bundle_sha256":"4899a5037c67fdba573c7d9d40e89bc6a5635e561b3d3ebd104b690b69b9c364"}}