{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MT2GYXED5TRV3SH2PML7M3UDDK","short_pith_number":"pith:MT2GYXED","schema_version":"1.0","canonical_sha256":"64f46c5c83ece35dc8fa7b17f66e831a9e29e9a3ba57c38a3f10b2202d78e6bf","source":{"kind":"arxiv","id":"1610.07499","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Complexity of the Dyck Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Patricia Bouyer, Vincent Jug\\'e","submitted_at":"2016-10-24T17:15:32Z","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 Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) while the others lie either in DynFO or in NL."},"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":"1610.07499","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-24T17:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"bed77e072ec360e200f6ec83361d77fe114b323d36481f9fb85a9edd63cae711","abstract_canon_sha256":"88cf8b37147f5d8b0a4c5a83e6efe446755bc9f600ed0012b1d15bba9b3bb74b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:20.630442Z","signature_b64":"6qN61f/1okBm6Bs7Ls2FX0RM6QvjTMeUAjDkAUumk/mth9B4GDlcFEogwW76BpZ/CBeLWxHhc7GH3Z5nuLshAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64f46c5c83ece35dc8fa7b17f66e831a9e29e9a3ba57c38a3f10b2202d78e6bf","last_reissued_at":"2026-05-18T00:46:20.629747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:20.629747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Complexity of the Dyck Reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Patricia Bouyer, Vincent Jug\\'e","submitted_at":"2016-10-24T17:15:32Z","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 Dyck reachability problems in directed and undirected graphs, where updates may add or delete edges. We show a strong dichotomy between such problems, based on the size of the Dyck alphabet. Some of them are P-complete (under a strong notion of reduction) while the others lie either in DynFO or in NL."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07499","kind":"arxiv","version":2},"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":"1610.07499","created_at":"2026-05-18T00:46:20.629848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07499v2","created_at":"2026-05-18T00:46:20.629848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07499","created_at":"2026-05-18T00:46:20.629848+00:00"},{"alias_kind":"pith_short_12","alias_value":"MT2GYXED5TRV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MT2GYXED5TRV3SH2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MT2GYXED","created_at":"2026-05-18T12:30:32.724797+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/MT2GYXED5TRV3SH2PML7M3UDDK","json":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK.json","graph_json":"https://pith.science/api/pith-number/MT2GYXED5TRV3SH2PML7M3UDDK/graph.json","events_json":"https://pith.science/api/pith-number/MT2GYXED5TRV3SH2PML7M3UDDK/events.json","paper":"https://pith.science/paper/MT2GYXED"},"agent_actions":{"view_html":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK","download_json":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK.json","view_paper":"https://pith.science/paper/MT2GYXED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07499&json=true","fetch_graph":"https://pith.science/api/pith-number/MT2GYXED5TRV3SH2PML7M3UDDK/graph.json","fetch_events":"https://pith.science/api/pith-number/MT2GYXED5TRV3SH2PML7M3UDDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK/action/storage_attestation","attest_author":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK/action/author_attestation","sign_citation":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK/action/citation_signature","submit_replication":"https://pith.science/pith/MT2GYXED5TRV3SH2PML7M3UDDK/action/replication_record"}},"created_at":"2026-05-18T00:46:20.629848+00:00","updated_at":"2026-05-18T00:46:20.629848+00:00"}