{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GEQY5ETV3U7AOLE4ZL6VJ7MODJ","short_pith_number":"pith:GEQY5ETV","canonical_record":{"source":{"id":"1509.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-09T09:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"aa3e396303be849adc7b727d7c65e5a02f930599d57375b28c50699d5ffa421c","abstract_canon_sha256":"4054284472f447e260d30d19d575ed1bec6034302c63249f2a8f048dee51044e"},"schema_version":"1.0"},"canonical_sha256":"31218e9275dd3e072c9ccafd54fd8e1a5085c82dcda11ea975c2dae4edf057bb","source":{"kind":"arxiv","id":"1509.02683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02683","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02683v1","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02683","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"GEQY5ETV3U7A","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GEQY5ETV3U7AOLE4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GEQY5ETV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GEQY5ETV3U7AOLE4ZL6VJ7MODJ","target":"record","payload":{"canonical_record":{"source":{"id":"1509.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-09T09:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"aa3e396303be849adc7b727d7c65e5a02f930599d57375b28c50699d5ffa421c","abstract_canon_sha256":"4054284472f447e260d30d19d575ed1bec6034302c63249f2a8f048dee51044e"},"schema_version":"1.0"},"canonical_sha256":"31218e9275dd3e072c9ccafd54fd8e1a5085c82dcda11ea975c2dae4edf057bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:34.358095Z","signature_b64":"eLq+jE+Hmqr7t3bi7+slPGiLWG0kqUtzEWU3l31dwMYG1y31PSfweK4qa9AEOcioDV8TsAKdl4c/ijUv2gxBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31218e9275dd3e072c9ccafd54fd8e1a5085c82dcda11ea975c2dae4edf057bb","last_reissued_at":"2026-05-18T01:33:34.357512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:34.357512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.02683","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-18T01:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5E4W/TmH8D9toyJXxoXTHb6yKyJmIugnKFNcCUl0/LsYFQSLUtaoKsBw/lQYIH+oIyy7CJYPw5k8k79d/s5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:21:37.334998Z"},"content_sha256":"3299ab2f8bdc500fe39da788d395b63b20a979445192b48e4f41e68cfb9294c0","schema_version":"1.0","event_id":"sha256:3299ab2f8bdc500fe39da788d395b63b20a979445192b48e4f41e68cfb9294c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GEQY5ETV3U7AOLE4ZL6VJ7MODJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Graph Constraint Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Tom C. van der Zanden","submitted_at":"2015-09-09T09:04:21Z","abstract_excerpt":"Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underlying constraint graph as parameters. As a main result we show that restricted NCL remains PSPACE-complete on graphs of bounded bandwidth, strengthening Hearn and Demaine's framework. This allows us to improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02683","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-18T01:33:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuslBioyviZbK03zkp186Sl7wNVVn9rbwxOnFd6EaqWaUYxoHMgY7tnth4P23JUow0j9C3qAJ4/2C8jcvxGOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:21:37.335750Z"},"content_sha256":"b7ab6f56889b33b8790729e3b75fe5e00dc8ce806a7eeae02bcaeb63c28920fc","schema_version":"1.0","event_id":"sha256:b7ab6f56889b33b8790729e3b75fe5e00dc8ce806a7eeae02bcaeb63c28920fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/bundle.json","state_url":"https://pith.science/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/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-31T03:21:37Z","links":{"resolver":"https://pith.science/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ","bundle":"https://pith.science/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/bundle.json","state":"https://pith.science/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEQY5ETV3U7AOLE4ZL6VJ7MODJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GEQY5ETV3U7AOLE4ZL6VJ7MODJ","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":"4054284472f447e260d30d19d575ed1bec6034302c63249f2a8f048dee51044e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-09T09:04:21Z","title_canon_sha256":"aa3e396303be849adc7b727d7c65e5a02f930599d57375b28c50699d5ffa421c"},"schema_version":"1.0","source":{"id":"1509.02683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.02683","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"arxiv_version","alias_value":"1509.02683v1","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.02683","created_at":"2026-05-18T01:33:34Z"},{"alias_kind":"pith_short_12","alias_value":"GEQY5ETV3U7A","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GEQY5ETV3U7AOLE4","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GEQY5ETV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:b7ab6f56889b33b8790729e3b75fe5e00dc8ce806a7eeae02bcaeb63c28920fc","target":"graph","created_at":"2026-05-18T01:33:34Z","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":"Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underlying constraint graph as parameters. As a main result we show that restricted NCL remains PSPACE-complete on graphs of bounded bandwidth, strengthening Hearn and Demaine's framework. This allows us to improv","authors_text":"Tom C. van der Zanden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-09T09:04:21Z","title":"Parameterized Complexity of Graph Constraint Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.02683","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:3299ab2f8bdc500fe39da788d395b63b20a979445192b48e4f41e68cfb9294c0","target":"record","created_at":"2026-05-18T01:33:34Z","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":"4054284472f447e260d30d19d575ed1bec6034302c63249f2a8f048dee51044e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-09T09:04:21Z","title_canon_sha256":"aa3e396303be849adc7b727d7c65e5a02f930599d57375b28c50699d5ffa421c"},"schema_version":"1.0","source":{"id":"1509.02683","kind":"arxiv","version":1}},"canonical_sha256":"31218e9275dd3e072c9ccafd54fd8e1a5085c82dcda11ea975c2dae4edf057bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31218e9275dd3e072c9ccafd54fd8e1a5085c82dcda11ea975c2dae4edf057bb","first_computed_at":"2026-05-18T01:33:34.357512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:34.357512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLq+jE+Hmqr7t3bi7+slPGiLWG0kqUtzEWU3l31dwMYG1y31PSfweK4qa9AEOcioDV8TsAKdl4c/ijUv2gxBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:34.358095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.02683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3299ab2f8bdc500fe39da788d395b63b20a979445192b48e4f41e68cfb9294c0","sha256:b7ab6f56889b33b8790729e3b75fe5e00dc8ce806a7eeae02bcaeb63c28920fc"],"state_sha256":"354fb813de18dbad7e7ddca9dd869e968d744dae0b82025c8ce7dd8ee05cae8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbzJIbV7NeGLGTz9DDOo4K/46fGhGyqDJ0xACxTvngb/BPCdQmW8veBm87IBHuzvuQUokZFgVec8VRKjNZe0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:21:37.339641Z","bundle_sha256":"26d249891586e885363087908dcf208ad1d6a9b9e12b589a50e3e2b3b014247e"}}