{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DMQXPOQWRHQM75HD4P5TFLKBR6","short_pith_number":"pith:DMQXPOQW","schema_version":"1.0","canonical_sha256":"1b2177ba1689e0cff4e3e3fb32ad418fa7e5d8f76a4ff8a8cce91b2189e7be77","source":{"kind":"arxiv","id":"1702.05183","version":1},"attestation_state":"computed","paper":{"title":"Courcelle's Theorem Made Dynamic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Nicolas Markey, Patricia Bouyer-Decitre, Vincent Jug\\'e","submitted_at":"2017-02-16T23:21:34Z","abstract_excerpt":"Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that this problem is in DynFO (with LOGSPACE precomputation), via a reduction to a Dyck reachability problem on an acyclic automaton."},"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":"1702.05183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-16T23:21:34Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4c8f07af1acec096799e8ef3425b6e4db29bde253b8e6e55f3b9ec822d1b207b","abstract_canon_sha256":"893eba4b5fce26fd3354ac94aaf69d91a9174bb993f9e3ef990d520539dee68e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.555449Z","signature_b64":"LfJeLQ9deR27ZWUrsnl4oYJx7iS6bQBFSn0c3fp95UCio49UxqScLdVwtm6/hIly9eoneHoH/5AxHN5mfvS/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2177ba1689e0cff4e3e3fb32ad418fa7e5d8f76a4ff8a8cce91b2189e7be77","last_reissued_at":"2026-05-18T00:50:34.554759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.554759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Courcelle's Theorem Made Dynamic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CC","authors_text":"Nicolas Markey, Patricia Bouyer-Decitre, Vincent Jug\\'e","submitted_at":"2017-02-16T23:21:34Z","abstract_excerpt":"Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of model checking a fixed monadic second-order formula over evolving subgraphs of a fixed maximal graph having bounded tree-width; here the subgraph evolves by losing or gaining edges (from the maximal graph). We show that this problem is in DynFO (with LOGSPACE precomputation), via a reduction to a Dyck reachability problem on an acyclic automaton."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05183","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":"1702.05183","created_at":"2026-05-18T00:50:34.554869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05183v1","created_at":"2026-05-18T00:50:34.554869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05183","created_at":"2026-05-18T00:50:34.554869+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMQXPOQWRHQM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMQXPOQWRHQM75HD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMQXPOQW","created_at":"2026-05-18T12:31:12.930513+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/DMQXPOQWRHQM75HD4P5TFLKBR6","json":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6.json","graph_json":"https://pith.science/api/pith-number/DMQXPOQWRHQM75HD4P5TFLKBR6/graph.json","events_json":"https://pith.science/api/pith-number/DMQXPOQWRHQM75HD4P5TFLKBR6/events.json","paper":"https://pith.science/paper/DMQXPOQW"},"agent_actions":{"view_html":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6","download_json":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6.json","view_paper":"https://pith.science/paper/DMQXPOQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05183&json=true","fetch_graph":"https://pith.science/api/pith-number/DMQXPOQWRHQM75HD4P5TFLKBR6/graph.json","fetch_events":"https://pith.science/api/pith-number/DMQXPOQWRHQM75HD4P5TFLKBR6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6/action/storage_attestation","attest_author":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6/action/author_attestation","sign_citation":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6/action/citation_signature","submit_replication":"https://pith.science/pith/DMQXPOQWRHQM75HD4P5TFLKBR6/action/replication_record"}},"created_at":"2026-05-18T00:50:34.554869+00:00","updated_at":"2026-05-18T00:50:34.554869+00:00"}