{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3TPAW3FB3AY3CWTI6YNQRPFLTS","short_pith_number":"pith:3TPAW3FB","schema_version":"1.0","canonical_sha256":"dcde0b6ca1d831b15a68f61b08bcab9c92243d9c166e950a66c07fc525dbd037","source":{"kind":"arxiv","id":"1804.09422","version":1},"attestation_state":"computed","paper":{"title":"Incremental Optimization of Independent Sets under Reachability Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Haruka Mizuta, Naomi Nishimura, Takehiro Ito","submitted_at":"2018-04-25T08:29:10Z","abstract_excerpt":"We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set $I_0$ of a graph $G$, and an integer $l \\ge 0$ which represents a lower bound on the size of any independent set of $G$. Then, we are asked to find an independent set of $G$ having the maximum size among independent sets that are reachable from $I_0$ by either adding or removing a single vertex at a time such that all intermediate independent sets are of size at least $l$. We show that this problem is PSPACE-hard even for bounded pathwid"},"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":"1804.09422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-25T08:29:10Z","cross_cats_sorted":[],"title_canon_sha256":"e180af5dfbf6c509f67eff760b6b0f540e16a8a2c54010772928fd582d4be6cd","abstract_canon_sha256":"68dbfecb866d1cd259fe76c37180abbba99422d9454f76055f480d5024019133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:31.849374Z","signature_b64":"Y3HIaTDOzDLgPitYbDzf4zjoUbwj3NbOwGRqTcQSZgbGQx9iWafxoNNCBlqBjcmdCtdP4VR4Y3L63pnPdfk/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcde0b6ca1d831b15a68f61b08bcab9c92243d9c166e950a66c07fc525dbd037","last_reissued_at":"2026-05-18T00:17:31.848857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:31.848857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Optimization of Independent Sets under Reachability Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Haruka Mizuta, Naomi Nishimura, Takehiro Ito","submitted_at":"2018-04-25T08:29:10Z","abstract_excerpt":"We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set $I_0$ of a graph $G$, and an integer $l \\ge 0$ which represents a lower bound on the size of any independent set of $G$. Then, we are asked to find an independent set of $G$ having the maximum size among independent sets that are reachable from $I_0$ by either adding or removing a single vertex at a time such that all intermediate independent sets are of size at least $l$. We show that this problem is PSPACE-hard even for bounded pathwid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09422","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":"1804.09422","created_at":"2026-05-18T00:17:31.848930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09422v1","created_at":"2026-05-18T00:17:31.848930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09422","created_at":"2026-05-18T00:17:31.848930+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TPAW3FB3AY3","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TPAW3FB3AY3CWTI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TPAW3FB","created_at":"2026-05-18T12:32:05.422762+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/3TPAW3FB3AY3CWTI6YNQRPFLTS","json":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS.json","graph_json":"https://pith.science/api/pith-number/3TPAW3FB3AY3CWTI6YNQRPFLTS/graph.json","events_json":"https://pith.science/api/pith-number/3TPAW3FB3AY3CWTI6YNQRPFLTS/events.json","paper":"https://pith.science/paper/3TPAW3FB"},"agent_actions":{"view_html":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS","download_json":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS.json","view_paper":"https://pith.science/paper/3TPAW3FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09422&json=true","fetch_graph":"https://pith.science/api/pith-number/3TPAW3FB3AY3CWTI6YNQRPFLTS/graph.json","fetch_events":"https://pith.science/api/pith-number/3TPAW3FB3AY3CWTI6YNQRPFLTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS/action/storage_attestation","attest_author":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS/action/author_attestation","sign_citation":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS/action/citation_signature","submit_replication":"https://pith.science/pith/3TPAW3FB3AY3CWTI6YNQRPFLTS/action/replication_record"}},"created_at":"2026-05-18T00:17:31.848930+00:00","updated_at":"2026-05-18T00:17:31.848930+00:00"}