{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:AIYJPVMOGHPGZZPFDEMVAUECTG","short_pith_number":"pith:AIYJPVMO","canonical_record":{"source":{"id":"1312.7605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-30T00:06:43Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"cafe59c28fc21b3bd26b72f51647f3a8a690d074a46e061de97afc6b09947b23","abstract_canon_sha256":"a7c7606bb65b8685da9bc03227d6eef6d98964de5236e4c1e21ebf7b648bfb67"},"schema_version":"1.0"},"canonical_sha256":"023097d58e31de6ce5e51919505082999ac8edf764b1e9d37e49cfcf39f46f44","source":{"kind":"arxiv","id":"1312.7605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7605","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7605v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7605","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"AIYJPVMOGHPG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIYJPVMOGHPGZZPF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIYJPVMO","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:AIYJPVMOGHPGZZPFDEMVAUECTG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-30T00:06:43Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"cafe59c28fc21b3bd26b72f51647f3a8a690d074a46e061de97afc6b09947b23","abstract_canon_sha256":"a7c7606bb65b8685da9bc03227d6eef6d98964de5236e4c1e21ebf7b648bfb67"},"schema_version":"1.0"},"canonical_sha256":"023097d58e31de6ce5e51919505082999ac8edf764b1e9d37e49cfcf39f46f44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:34.251755Z","signature_b64":"RWwL8nzCHwCghYve20FresOhCKFRFS0DQn/vaKp97Sq8kPLJHAumt4GhpMA9eGCkgjICNeCDXu+CN1oh764SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"023097d58e31de6ce5e51919505082999ac8edf764b1e9d37e49cfcf39f46f44","last_reissued_at":"2026-05-18T03:03:34.251213Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:34.251213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7605","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDylOKA96iR7yK83sjMBXVItbQrNF41MeUBRp099gcdciuKxJyr7Q3oU/oRdv5UeKAo67BpG5R+KSxuGLn6wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:57:25.815596Z"},"content_sha256":"accbdd241382be30f740702e0dae2119e4841fb2f465497a3bb94842fa45db7e","schema_version":"1.0","event_id":"sha256:accbdd241382be30f740702e0dae2119e4841fb2f465497a3bb94842fa45db7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:AIYJPVMOGHPGZZPFDEMVAUECTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint Satisfaction with Counting Quantifiers 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.LO","authors_text":"Barnaby Martin, Juraj Stacho","submitted_at":"2013-12-30T00:06:43Z","abstract_excerpt":"We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\\exists^{\\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper, we focus on the complexity of undirected graph templates. As our main contribution, we settle the two principal open questions proposed in (CSR 2012). Firstly, we complete the classification of clique templates by proving a full trichotomy for all possible combinations of counting quantifiers and clique sizes, placing each case either in P, NP-complete or P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7605","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-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/K2O5VtoPsZAaB2aSwkGW+SfVaG3abV3YzFPmJRQ/Hh1st1wNY42qu+QB0SFiXmGQ3m4nn+446pbP1oJG8jkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:57:25.815961Z"},"content_sha256":"b3d52a563a262943f54fe09b0fa74b4deedc9065540697a711156fe4996b7e2e","schema_version":"1.0","event_id":"sha256:b3d52a563a262943f54fe09b0fa74b4deedc9065540697a711156fe4996b7e2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/bundle.json","state_url":"https://pith.science/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/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-06-04T17:57:25Z","links":{"resolver":"https://pith.science/pith/AIYJPVMOGHPGZZPFDEMVAUECTG","bundle":"https://pith.science/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/bundle.json","state":"https://pith.science/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIYJPVMOGHPGZZPFDEMVAUECTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AIYJPVMOGHPGZZPFDEMVAUECTG","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":"a7c7606bb65b8685da9bc03227d6eef6d98964de5236e4c1e21ebf7b648bfb67","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-30T00:06:43Z","title_canon_sha256":"cafe59c28fc21b3bd26b72f51647f3a8a690d074a46e061de97afc6b09947b23"},"schema_version":"1.0","source":{"id":"1312.7605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7605","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7605v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7605","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"AIYJPVMOGHPG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AIYJPVMOGHPGZZPF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AIYJPVMO","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:b3d52a563a262943f54fe09b0fa74b4deedc9065540697a711156fe4996b7e2e","target":"graph","created_at":"2026-05-18T03:03: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":"We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\\exists^{\\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper, we focus on the complexity of undirected graph templates. As our main contribution, we settle the two principal open questions proposed in (CSR 2012). Firstly, we complete the classification of clique templates by proving a full trichotomy for all possible combinations of counting quantifiers and clique sizes, placing each case either in P, NP-complete or P","authors_text":"Barnaby Martin, Juraj Stacho","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-30T00:06:43Z","title":"Constraint Satisfaction with Counting Quantifiers 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7605","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:accbdd241382be30f740702e0dae2119e4841fb2f465497a3bb94842fa45db7e","target":"record","created_at":"2026-05-18T03:03: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":"a7c7606bb65b8685da9bc03227d6eef6d98964de5236e4c1e21ebf7b648bfb67","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-30T00:06:43Z","title_canon_sha256":"cafe59c28fc21b3bd26b72f51647f3a8a690d074a46e061de97afc6b09947b23"},"schema_version":"1.0","source":{"id":"1312.7605","kind":"arxiv","version":1}},"canonical_sha256":"023097d58e31de6ce5e51919505082999ac8edf764b1e9d37e49cfcf39f46f44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"023097d58e31de6ce5e51919505082999ac8edf764b1e9d37e49cfcf39f46f44","first_computed_at":"2026-05-18T03:03:34.251213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:34.251213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWwL8nzCHwCghYve20FresOhCKFRFS0DQn/vaKp97Sq8kPLJHAumt4GhpMA9eGCkgjICNeCDXu+CN1oh764SBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:34.251755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:accbdd241382be30f740702e0dae2119e4841fb2f465497a3bb94842fa45db7e","sha256:b3d52a563a262943f54fe09b0fa74b4deedc9065540697a711156fe4996b7e2e"],"state_sha256":"0098b61fe5a98bea1d5e100ad31cc464e1f7191e10694501ac98af1ad46060e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmLRU6N3ywumsHx9drP2BDQlPSXBymzkr4iqQyky83SVbkWQ6qZXrsZ+4vaM0fXYxgRjtv+OmpT4w1iATtqXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:57:25.817937Z","bundle_sha256":"13e63275ccdd0d717abad8d7bf3d2bfdca619f4a4045a3a51378ad92d2ae746c"}}