{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","short_pith_number":"pith:LJ6FOPQJ","canonical_record":{"source":{"id":"1312.6260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-21T15:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"a237d11058448f47a1e8c07947656caba478006573946b6de8d49417deb9cab3","abstract_canon_sha256":"f55f5b36d85a07118f37cc89b2ba7e80f45bd7ad093c5d1141d1363135f63880"},"schema_version":"1.0"},"canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","source":{"kind":"arxiv","id":"1312.6260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6260","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6260v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6260","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6FOPQJ7AIY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6FOPQJ7AIYEZRP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6FOPQJ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-21T15:08:22Z","cross_cats_sorted":[],"title_canon_sha256":"a237d11058448f47a1e8c07947656caba478006573946b6de8d49417deb9cab3","abstract_canon_sha256":"f55f5b36d85a07118f37cc89b2ba7e80f45bd7ad093c5d1141d1363135f63880"},"schema_version":"1.0"},"canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.845134Z","signature_b64":"FP7N0uNU/w4OK9K+sxWiUZ+E/5QNMGUv3hEPqIuqV9grO4QgJRN1Djc1RL9YYOQWCEteyOzaLAXVxNDKNYNCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","last_reissued_at":"2026-05-18T00:38:36.844719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.844719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6260","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-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6Gsk+mkByPUfRaSZU7ZVR4w6dx9xiPivKIfzpF6Fo/C+14C11PZ7+Z/5Gghgb6dMVkBgroTQzNx2m0RTn0dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:33.115448Z"},"content_sha256":"cb89add467b346fde0e6fce7f36a952728774533875bf37a0abd5069c7b7310c","schema_version":"1.0","event_id":"sha256:cb89add467b346fde0e6fce7f36a952728774533875bf37a0abd5069c7b7310c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Algorithms for Maximum Independent Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","submitted_at":"2013-12-21T15:08:22Z","abstract_excerpt":"We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.1893^nn^{O(1)}$ and $1.1970^nn^{O(1)}$, respectively. Our algorithms are obtained by using fast algorithms for MIS in low-degree graphs in a hierarchical way and making a careful analyses on the structure of bounded-degree graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6260","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-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ee3ljFEMwB3nhINLdM3hcOl/SKAlenNdHd7jE3evJadt59hh0gS8Uyqw7y5DU6HTZfuoORRQn5ooEpfUZw7yDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:33.115801Z"},"content_sha256":"a2a00ff38c33ca0c9db9aaaf8ae1d13ebba4bb39bfe96ba12386c9f383131d65","schema_version":"1.0","event_id":"sha256:a2a00ff38c33ca0c9db9aaaf8ae1d13ebba4bb39bfe96ba12386c9f383131d65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/bundle.json","state_url":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/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-05-28T11:09:33Z","links":{"resolver":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","bundle":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/bundle.json","state":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","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":"f55f5b36d85a07118f37cc89b2ba7e80f45bd7ad093c5d1141d1363135f63880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-21T15:08:22Z","title_canon_sha256":"a237d11058448f47a1e8c07947656caba478006573946b6de8d49417deb9cab3"},"schema_version":"1.0","source":{"id":"1312.6260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6260","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6260v1","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6260","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6FOPQJ7AIY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6FOPQJ7AIYEZRP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6FOPQJ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:a2a00ff38c33ca0c9db9aaaf8ae1d13ebba4bb39bfe96ba12386c9f383131d65","target":"graph","created_at":"2026-05-18T00:38:36Z","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":"We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of $1.1893^nn^{O(1)}$ and $1.1970^nn^{O(1)}$, respectively. Our algorithms are obtained by using fast algorithms for MIS in low-degree graphs in a hierarchical way and making a careful analyses on the structure of bounded-degree graphs.","authors_text":"Hiroshi Nagamochi, Mingyu Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-21T15:08:22Z","title":"Exact Algorithms for Maximum Independent Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6260","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:cb89add467b346fde0e6fce7f36a952728774533875bf37a0abd5069c7b7310c","target":"record","created_at":"2026-05-18T00:38:36Z","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":"f55f5b36d85a07118f37cc89b2ba7e80f45bd7ad093c5d1141d1363135f63880","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-21T15:08:22Z","title_canon_sha256":"a237d11058448f47a1e8c07947656caba478006573946b6de8d49417deb9cab3"},"schema_version":"1.0","source":{"id":"1312.6260","kind":"arxiv","version":1}},"canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","first_computed_at":"2026-05-18T00:38:36.844719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:36.844719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FP7N0uNU/w4OK9K+sxWiUZ+E/5QNMGUv3hEPqIuqV9grO4QgJRN1Djc1RL9YYOQWCEteyOzaLAXVxNDKNYNCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:36.845134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb89add467b346fde0e6fce7f36a952728774533875bf37a0abd5069c7b7310c","sha256:a2a00ff38c33ca0c9db9aaaf8ae1d13ebba4bb39bfe96ba12386c9f383131d65"],"state_sha256":"745e3d61ce7f17261f856d39e5989224ba123fec448fc4ccc8977c736992c508"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjtFegFvNkMG/Fe0mgv84MEY4/YhGhFczU3i+c+/ii9XnMMYiGD6C0eRVoBx29hNxREu41ONjbNt7j813YjoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:09:33.117989Z","bundle_sha256":"20b95519731337b2f24db1c8bcdc4f7f1c3e7f2a936efb16ec82447c708fc0c0"}}