{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C2GOTKRXK6EF5TKSFEUCGVCJ3V","short_pith_number":"pith:C2GOTKRX","canonical_record":{"source":{"id":"1104.3148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c762048c8c74eb9fea59d8d196ece5b709f851e14b6ea16076bd622995d2c9d","abstract_canon_sha256":"98fd7562b92a2d8511d4533494029673486ed2e26cc78796d5ad9e79179ba600"},"schema_version":"1.0"},"canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","source":{"kind":"arxiv","id":"1104.3148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3148","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3148v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3148","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"C2GOTKRXK6EF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C2GOTKRXK6EF5TKS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C2GOTKRX","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C2GOTKRXK6EF5TKSFEUCGVCJ3V","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c762048c8c74eb9fea59d8d196ece5b709f851e14b6ea16076bd622995d2c9d","abstract_canon_sha256":"98fd7562b92a2d8511d4533494029673486ed2e26cc78796d5ad9e79179ba600"},"schema_version":"1.0"},"canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.687206Z","signature_b64":"VjSBCgQEyPPV86a+BwCIR8gjdq2qn8o6JZRtT7CxeORcpvsyKallI2SNmJiq8ijLSbA52rzVCuZgjgnsGWLjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","last_reissued_at":"2026-05-18T04:24:05.686615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.686615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3148","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Atc5ZhXScneCAsJ9ZZKJu/AIlhkzOP+CLrMSncBN90cjMYg7ulJ/8Jc+k4fkXlbEVl9vBodcgfYeu8tIaG1zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:29:30.244037Z"},"content_sha256":"31ad8033d5f4d6879b56b92ebb1743fbcd610799fe5a0e4326932d5826231f41","schema_version":"1.0","event_id":"sha256:31ad8033d5f4d6879b56b92ebb1743fbcd610799fe5a0e4326932d5826231f41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C2GOTKRXK6EF5TKSFEUCGVCJ3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of two-variable Dependence Logic and IF-Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Antti Kuusisto, Jonni Virtema, Juha Kontinen, Peter Lohmann","submitted_at":"2011-04-15T20:13:14Z","abstract_excerpt":"We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a constant symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3148","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juLfY/J59CIIm4HlwSf8s/RureWYk/wS8TQ+Xqr93h3wwv0JnIuC7SmGsH0bQErN74lLsu0cV9gPRa0htPXTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:29:30.244697Z"},"content_sha256":"097de8881bfc1316168e6570206120d596a409aee910644c6a65022c181efcec","schema_version":"1.0","event_id":"sha256:097de8881bfc1316168e6570206120d596a409aee910644c6a65022c181efcec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/bundle.json","state_url":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/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-25T21:29:30Z","links":{"resolver":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V","bundle":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/bundle.json","state":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C2GOTKRXK6EF5TKSFEUCGVCJ3V","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":"98fd7562b92a2d8511d4533494029673486ed2e26cc78796d5ad9e79179ba600","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","title_canon_sha256":"1c762048c8c74eb9fea59d8d196ece5b709f851e14b6ea16076bd622995d2c9d"},"schema_version":"1.0","source":{"id":"1104.3148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3148","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3148v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3148","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"C2GOTKRXK6EF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C2GOTKRXK6EF5TKS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C2GOTKRX","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:097de8881bfc1316168e6570206120d596a409aee910644c6a65022c181efcec","target":"graph","created_at":"2026-05-18T04:24:05Z","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":"We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a constant symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on L","authors_text":"Antti Kuusisto, Jonni Virtema, Juha Kontinen, Peter Lohmann","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","title":"Complexity of two-variable Dependence Logic and IF-Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3148","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:31ad8033d5f4d6879b56b92ebb1743fbcd610799fe5a0e4326932d5826231f41","target":"record","created_at":"2026-05-18T04:24:05Z","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":"98fd7562b92a2d8511d4533494029673486ed2e26cc78796d5ad9e79179ba600","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","title_canon_sha256":"1c762048c8c74eb9fea59d8d196ece5b709f851e14b6ea16076bd622995d2c9d"},"schema_version":"1.0","source":{"id":"1104.3148","kind":"arxiv","version":1}},"canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","first_computed_at":"2026-05-18T04:24:05.686615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.686615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VjSBCgQEyPPV86a+BwCIR8gjdq2qn8o6JZRtT7CxeORcpvsyKallI2SNmJiq8ijLSbA52rzVCuZgjgnsGWLjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.687206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31ad8033d5f4d6879b56b92ebb1743fbcd610799fe5a0e4326932d5826231f41","sha256:097de8881bfc1316168e6570206120d596a409aee910644c6a65022c181efcec"],"state_sha256":"9e9b086894b55e1cd79db1d672c299e826c21047e0fea94ebb831d0663c42754"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VeNkjTLXgY9k2RPph05VE0NBHSJNggCNrH3ZLL2Frb/AE5g/WHP6kK7KPyXf6Z9CggWyHitTJ4rrXHelzoUlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:29:30.248297Z","bundle_sha256":"a77b47b9c564499f73fc238c206c35d2d72653905e7268d5bda944524964bdcb"}}