{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CQVIJ3JDAPLS2LJZQJZ4JTIPWK","short_pith_number":"pith:CQVIJ3JD","canonical_record":{"source":{"id":"1312.4428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-16T16:59:49Z","cross_cats_sorted":[],"title_canon_sha256":"0acef416e6b9188d3720ae06493c3df017236959b266d32c8d1d7ff99cc40958","abstract_canon_sha256":"94d93411e92fec33ebf3d3a7b9501172a4c3296318740d29fa6e22d21bcb9e6a"},"schema_version":"1.0"},"canonical_sha256":"142a84ed2303d72d2d398273c4cd0fb29ba167e3a6c1cd0ada4e941b0be79332","source":{"kind":"arxiv","id":"1312.4428","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4428","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4428v2","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4428","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"CQVIJ3JDAPLS","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CQVIJ3JDAPLS2LJZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CQVIJ3JD","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CQVIJ3JDAPLS2LJZQJZ4JTIPWK","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-16T16:59:49Z","cross_cats_sorted":[],"title_canon_sha256":"0acef416e6b9188d3720ae06493c3df017236959b266d32c8d1d7ff99cc40958","abstract_canon_sha256":"94d93411e92fec33ebf3d3a7b9501172a4c3296318740d29fa6e22d21bcb9e6a"},"schema_version":"1.0"},"canonical_sha256":"142a84ed2303d72d2d398273c4cd0fb29ba167e3a6c1cd0ada4e941b0be79332","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.662559Z","signature_b64":"Hd6wXSU76chPr64pNlWqPg5eftioY6H7g2jXbUdDJY9GosFZ/tcu6J5LTESOvZJpXcBqcWpK+hv5eq3gGKzFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142a84ed2303d72d2d398273c4cd0fb29ba167e3a6c1cd0ada4e941b0be79332","last_reissued_at":"2026-05-18T03:04:23.662186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.662186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4428","source_version":2,"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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0YzyoA+xgneTKlUR+q2e4kuhBu1r62ycY9k2FCuCxPTBORG5EJbX1KjepPQQY34wwudQYayG1k/r3BaCqDDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:08:57.320902Z"},"content_sha256":"a44d22eacb3fc1cc5119855eae93c38137db52998ba574c2e965d2c493e86de3","schema_version":"1.0","event_id":"sha256:a44d22eacb3fc1cc5119855eae93c38137db52998ba574c2e965d2c493e86de3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CQVIJ3JDAPLS2LJZQJZ4JTIPWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Constraint Satisfaction Problems below P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Laszlo Egri","submitted_at":"2013-12-16T16:59:49Z","abstract_excerpt":"Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Datalog is an important task. It is widely known that a CSP is definable in Datalog and linear Datalog if and only if that CSP has bounded treewidth and bounded pathwidth duality, respectively. In the case of symmetric Datalog, Bulatov, Krokhin and Larose ask for such a duality (2008). We provide two such dualities, and give applications. In particul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4428","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"},"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-18T03:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxk4h6sabT5jh79GNxS+vd1XZMSIFR2jW3RSkybDZWprNCf3xTcMtLcRB3LRRKic7LcogjxZqGXAct2XaOiGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:08:57.321244Z"},"content_sha256":"ae4ae2a40346c41f031ae655017914da15f1186a0323a24703494e3bf8b8b098","schema_version":"1.0","event_id":"sha256:ae4ae2a40346c41f031ae655017914da15f1186a0323a24703494e3bf8b8b098"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/bundle.json","state_url":"https://pith.science/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/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-30T01:08:57Z","links":{"resolver":"https://pith.science/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK","bundle":"https://pith.science/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/bundle.json","state":"https://pith.science/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQVIJ3JDAPLS2LJZQJZ4JTIPWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CQVIJ3JDAPLS2LJZQJZ4JTIPWK","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":"94d93411e92fec33ebf3d3a7b9501172a4c3296318740d29fa6e22d21bcb9e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-16T16:59:49Z","title_canon_sha256":"0acef416e6b9188d3720ae06493c3df017236959b266d32c8d1d7ff99cc40958"},"schema_version":"1.0","source":{"id":"1312.4428","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4428","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4428v2","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4428","created_at":"2026-05-18T03:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"CQVIJ3JDAPLS","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CQVIJ3JDAPLS2LJZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CQVIJ3JD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:ae4ae2a40346c41f031ae655017914da15f1186a0323a24703494e3bf8b8b098","target":"graph","created_at":"2026-05-18T03:04:23Z","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":"Symmetric Datalog, a fragment of the logic programming language Datalog, is conjectured to capture all constraint satisfaction problems (CSP) in L. Therefore developing tools that help us understand whether or not a CSP can be defined in symmetric Datalog is an important task. It is widely known that a CSP is definable in Datalog and linear Datalog if and only if that CSP has bounded treewidth and bounded pathwidth duality, respectively. In the case of symmetric Datalog, Bulatov, Krokhin and Larose ask for such a duality (2008). We provide two such dualities, and give applications. In particul","authors_text":"Laszlo Egri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-16T16:59:49Z","title":"On Constraint Satisfaction Problems below P"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4428","kind":"arxiv","version":2},"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:a44d22eacb3fc1cc5119855eae93c38137db52998ba574c2e965d2c493e86de3","target":"record","created_at":"2026-05-18T03:04:23Z","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":"94d93411e92fec33ebf3d3a7b9501172a4c3296318740d29fa6e22d21bcb9e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-16T16:59:49Z","title_canon_sha256":"0acef416e6b9188d3720ae06493c3df017236959b266d32c8d1d7ff99cc40958"},"schema_version":"1.0","source":{"id":"1312.4428","kind":"arxiv","version":2}},"canonical_sha256":"142a84ed2303d72d2d398273c4cd0fb29ba167e3a6c1cd0ada4e941b0be79332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142a84ed2303d72d2d398273c4cd0fb29ba167e3a6c1cd0ada4e941b0be79332","first_computed_at":"2026-05-18T03:04:23.662186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:23.662186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hd6wXSU76chPr64pNlWqPg5eftioY6H7g2jXbUdDJY9GosFZ/tcu6J5LTESOvZJpXcBqcWpK+hv5eq3gGKzFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:23.662559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4428","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44d22eacb3fc1cc5119855eae93c38137db52998ba574c2e965d2c493e86de3","sha256:ae4ae2a40346c41f031ae655017914da15f1186a0323a24703494e3bf8b8b098"],"state_sha256":"0decd37227783a0dd3d7705033406026287c0599dfb3deb925dcff056f4bd41b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9XPxKPtfjt5uTOSNcAAwcbhSm2LnWJYlwCzmuNaOQwTt6V0jguO0ycFq5dU0YAhCkayeoB5rqLmDUwsepjzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:08:57.323291Z","bundle_sha256":"6255064697a04105262f6b6993dc201685057fec7fc6217766358908262dc130"}}