{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","short_pith_number":"pith:LJ6FOPQJ","schema_version":"1.0","canonical_sha256":"5a7c573e09f81182662f4ba1d992ac1367ba0329000a4cde1584d59b4a14ec73","source":{"kind":"arxiv","id":"1312.6260","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.6260","created_at":"2026-05-18T00:38:36.844781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6260v1","created_at":"2026-05-18T00:38:36.844781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6260","created_at":"2026-05-18T00:38:36.844781+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ6FOPQJ7AIY","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ6FOPQJ7AIYEZRP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ6FOPQJ","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","json":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN.json","graph_json":"https://pith.science/api/pith-number/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/graph.json","events_json":"https://pith.science/api/pith-number/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/events.json","paper":"https://pith.science/paper/LJ6FOPQJ"},"agent_actions":{"view_html":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN","download_json":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN.json","view_paper":"https://pith.science/paper/LJ6FOPQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6260&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/action/storage_attestation","attest_author":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/action/author_attestation","sign_citation":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/action/citation_signature","submit_replication":"https://pith.science/pith/LJ6FOPQJ7AIYEZRPJOQ5TEVMCN/action/replication_record"}},"created_at":"2026-05-18T00:38:36.844781+00:00","updated_at":"2026-05-18T00:38:36.844781+00:00"}