{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:HHW22GFAQDK7HLPVO22D7MBFQM","short_pith_number":"pith:HHW22GFA","canonical_record":{"source":{"id":"cs/0504027","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-04-07T16:07:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"135e9ffbe989540c45849cbd60cb2f2f06a963187fa00c1b51908c105f24ddd6","abstract_canon_sha256":"4d9f42649fa035434655a2c9c22b5f5bedd4fd419f020e695249b9be7ef48b81"},"schema_version":"1.0"},"canonical_sha256":"39edad18a080d5f3adf576b43fb025833199b73690d0913ac0df720a167603cd","source":{"kind":"arxiv","id":"cs/0504027","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504027","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0504027v4","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504027","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"HHW22GFAQDK7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"HHW22GFAQDK7HLPV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"HHW22GFA","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:HHW22GFAQDK7HLPVO22D7MBFQM","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0504027","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-04-07T16:07:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"135e9ffbe989540c45849cbd60cb2f2f06a963187fa00c1b51908c105f24ddd6","abstract_canon_sha256":"4d9f42649fa035434655a2c9c22b5f5bedd4fd419f020e695249b9be7ef48b81"},"schema_version":"1.0"},"canonical_sha256":"39edad18a080d5f3adf576b43fb025833199b73690d0913ac0df720a167603cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.509682Z","signature_b64":"bxqo/y0t1GjRDe8FwYesZF5VD9eqCyQKDRB1T86H5y+3xtWitr/M35RNR1gwU4nvcfhkvZM/j48BQ4+EswDADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39edad18a080d5f3adf576b43fb025833199b73690d0913ac0df720a167603cd","last_reissued_at":"2026-05-18T00:53:03.509204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.509204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0504027","source_version":4,"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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rG8Qo2SlaqFOtY/tDP5EarIfmWSBEZjTbOU8oCs/puFsa4vUIX/mN4c2XBGy3qFghRdRtmyyZwvlqPRVsXNjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:15:09.287516Z"},"content_sha256":"2543109be5150149d346ebfbbfa19b5851b0b522f5fb587b2ef7023f52577865","schema_version":"1.0","event_id":"sha256:2543109be5150149d346ebfbbfa19b5851b0b522f5fb587b2ef7023f52577865"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:HHW22GFAQDK7HLPVO22D7MBFQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Datalog and Bounded Path Duality of Relational Structures","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Victor Dalmau","submitted_at":"2005-04-07T16:07:03Z","abstract_excerpt":"In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems, all these concepts correspond to different mathematical embodiments of a unique robust notion that we call bounded path duality. We also study the computational complexity implications of the notion of bounded path duality. We show that every constraint satisfaction problem $\\csp(\\best)$ with bounded path duality is solvable in NL and that this notion explain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504027","kind":"arxiv","version":4},"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-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0va39IlPU/M8fYXzFzV++zGjJ2DQz42e+pjgca8G6QZ5RnyoY0N1yMi5FE+n3gSDc8+lMOx4hLu2Zi+30EZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:15:09.288295Z"},"content_sha256":"d55d1ec51c110c868d687490d6823e8e5c2d1f475e0e88ec8bc9903ef5c686d5","schema_version":"1.0","event_id":"sha256:d55d1ec51c110c868d687490d6823e8e5c2d1f475e0e88ec8bc9903ef5c686d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHW22GFAQDK7HLPVO22D7MBFQM/bundle.json","state_url":"https://pith.science/pith/HHW22GFAQDK7HLPVO22D7MBFQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHW22GFAQDK7HLPVO22D7MBFQM/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-31T17:15:09Z","links":{"resolver":"https://pith.science/pith/HHW22GFAQDK7HLPVO22D7MBFQM","bundle":"https://pith.science/pith/HHW22GFAQDK7HLPVO22D7MBFQM/bundle.json","state":"https://pith.science/pith/HHW22GFAQDK7HLPVO22D7MBFQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHW22GFAQDK7HLPVO22D7MBFQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:HHW22GFAQDK7HLPVO22D7MBFQM","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":"4d9f42649fa035434655a2c9c22b5f5bedd4fd419f020e695249b9be7ef48b81","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.LO","submitted_at":"2005-04-07T16:07:03Z","title_canon_sha256":"135e9ffbe989540c45849cbd60cb2f2f06a963187fa00c1b51908c105f24ddd6"},"schema_version":"1.0","source":{"id":"cs/0504027","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504027","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0504027v4","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504027","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"HHW22GFAQDK7","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"HHW22GFAQDK7HLPV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"HHW22GFA","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:d55d1ec51c110c868d687490d6823e8e5c2d1f475e0e88ec8bc9903ef5c686d5","target":"graph","created_at":"2026-05-18T00:53:03Z","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":"In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems, all these concepts correspond to different mathematical embodiments of a unique robust notion that we call bounded path duality. We also study the computational complexity implications of the notion of bounded path duality. We show that every constraint satisfaction problem $\\csp(\\best)$ with bounded path duality is solvable in NL and that this notion explain","authors_text":"Victor Dalmau","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2005-04-07T16:07:03Z","title":"Linear Datalog and Bounded Path Duality of Relational Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504027","kind":"arxiv","version":4},"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:2543109be5150149d346ebfbbfa19b5851b0b522f5fb587b2ef7023f52577865","target":"record","created_at":"2026-05-18T00:53:03Z","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":"4d9f42649fa035434655a2c9c22b5f5bedd4fd419f020e695249b9be7ef48b81","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.LO","submitted_at":"2005-04-07T16:07:03Z","title_canon_sha256":"135e9ffbe989540c45849cbd60cb2f2f06a963187fa00c1b51908c105f24ddd6"},"schema_version":"1.0","source":{"id":"cs/0504027","kind":"arxiv","version":4}},"canonical_sha256":"39edad18a080d5f3adf576b43fb025833199b73690d0913ac0df720a167603cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39edad18a080d5f3adf576b43fb025833199b73690d0913ac0df720a167603cd","first_computed_at":"2026-05-18T00:53:03.509204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.509204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bxqo/y0t1GjRDe8FwYesZF5VD9eqCyQKDRB1T86H5y+3xtWitr/M35RNR1gwU4nvcfhkvZM/j48BQ4+EswDADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.509682Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0504027","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2543109be5150149d346ebfbbfa19b5851b0b522f5fb587b2ef7023f52577865","sha256:d55d1ec51c110c868d687490d6823e8e5c2d1f475e0e88ec8bc9903ef5c686d5"],"state_sha256":"3f1ff637b94554e76fdda9b2cac13c0793ff02449fe7bf4a79c9310713ab0c63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYZfHtf3cVjchgg+f68uFfdMleiGeYHC+ZL3RhOMfKrozvJzORI8VpNGPgVksaPhoRRg6GIZ9Uc1XUHvdwQBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:15:09.293275Z","bundle_sha256":"a4743fe16776e5ebd86b97c4ae1c8683121b017400db22930b8cddae9306a319"}}