{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:A4GOV4RI735BFZUVGZCSOKE3IY","short_pith_number":"pith:A4GOV4RI","canonical_record":{"source":{"id":"2506.09133","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T18:00:09Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"bce21280872ba7f7e29c648cf2ccadb698c45a5e668863cb69c4884e9156fb0e","abstract_canon_sha256":"c4ff78ced6277de859fa2143e79b8212e42bcb6eec2ed66f848259199104266c"},"schema_version":"1.0"},"canonical_sha256":"070ceaf228fefa12e695364527289b462e140bab3b104fbd1305c236da121a28","source":{"kind":"arxiv","id":"2506.09133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09133","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09133v1","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09133","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"A4GOV4RI735B","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"A4GOV4RI735BFZUV","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"A4GOV4RI","created_at":"2026-07-05T11:19:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:A4GOV4RI735BFZUVGZCSOKE3IY","target":"record","payload":{"canonical_record":{"source":{"id":"2506.09133","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T18:00:09Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"bce21280872ba7f7e29c648cf2ccadb698c45a5e668863cb69c4884e9156fb0e","abstract_canon_sha256":"c4ff78ced6277de859fa2143e79b8212e42bcb6eec2ed66f848259199104266c"},"schema_version":"1.0"},"canonical_sha256":"070ceaf228fefa12e695364527289b462e140bab3b104fbd1305c236da121a28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:31.875109Z","signature_b64":"5qBJXnt4rOSf1+liGvTAe6oaUAi3IN8tuLs06azcFkmJe/mV/WDwAUx9OI1R13W6zErQEXZyuTiph2dns22jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"070ceaf228fefa12e695364527289b462e140bab3b104fbd1305c236da121a28","last_reissued_at":"2026-07-05T11:19:31.874649Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:31.874649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.09133","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-07-05T11:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deMgY0QSnTDWyTkD+E22UrwsJz8HfDx/7CxSCNruoK/LdrsQmSrvYXja6DYpTUPTfUubysfBmCLlleOLThzyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:55:48.340002Z"},"content_sha256":"8105267144fcbad7386856405ef81a808782eeaad94acd0a2eb0fef488a08455","schema_version":"1.0","event_id":"sha256:8105267144fcbad7386856405ef81a808782eeaad94acd0a2eb0fef488a08455"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:A4GOV4RI735BFZUVGZCSOKE3IY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Contextuality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"quant-ph","authors_text":"Farid Shahandeh, Theodoros Yianni","submitted_at":"2025-06-10T18:00:09Z","abstract_excerpt":"Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if a theory admits a noncontextual ontological model; Second, determining the complexity of deciding if such a model is possible for a specific dimension $k$; Third, efficiently computing the smallest such model when it exists, given that finding the smallest ontological model is NP-hard. We address the second problem by presenting an algorithm derived from a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09133","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.09133/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:19:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"us+RWdamV7TjKdjBoXQEbU1Yr1X/Msx/F+PhmWK5rzfLINSG/reaohi11qoQ4+hWHiGIGIlqfreo1t8Vns+qAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:55:48.340990Z"},"content_sha256":"528888d0225aa4f595c74beb818cd7570956d6c9dccc4cd2017a1e656df21d00","schema_version":"1.0","event_id":"sha256:528888d0225aa4f595c74beb818cd7570956d6c9dccc4cd2017a1e656df21d00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4GOV4RI735BFZUVGZCSOKE3IY/bundle.json","state_url":"https://pith.science/pith/A4GOV4RI735BFZUVGZCSOKE3IY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4GOV4RI735BFZUVGZCSOKE3IY/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-08-05T09:55:48Z","links":{"resolver":"https://pith.science/pith/A4GOV4RI735BFZUVGZCSOKE3IY","bundle":"https://pith.science/pith/A4GOV4RI735BFZUVGZCSOKE3IY/bundle.json","state":"https://pith.science/pith/A4GOV4RI735BFZUVGZCSOKE3IY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4GOV4RI735BFZUVGZCSOKE3IY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A4GOV4RI735BFZUVGZCSOKE3IY","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":"c4ff78ced6277de859fa2143e79b8212e42bcb6eec2ed66f848259199104266c","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T18:00:09Z","title_canon_sha256":"bce21280872ba7f7e29c648cf2ccadb698c45a5e668863cb69c4884e9156fb0e"},"schema_version":"1.0","source":{"id":"2506.09133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09133","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09133v1","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09133","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_12","alias_value":"A4GOV4RI735B","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_16","alias_value":"A4GOV4RI735BFZUV","created_at":"2026-07-05T11:19:31Z"},{"alias_kind":"pith_short_8","alias_value":"A4GOV4RI","created_at":"2026-07-05T11:19:31Z"}],"graph_snapshots":[{"event_id":"sha256:528888d0225aa4f595c74beb818cd7570956d6c9dccc4cd2017a1e656df21d00","target":"graph","created_at":"2026-07-05T11:19:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.09133/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if a theory admits a noncontextual ontological model; Second, determining the complexity of deciding if such a model is possible for a specific dimension $k$; Third, efficiently computing the smallest such model when it exists, given that finding the smallest ontological model is NP-hard. We address the second problem by presenting an algorithm derived from a g","authors_text":"Farid Shahandeh, Theodoros Yianni","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T18:00:09Z","title":"Complexity of Contextuality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09133","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:8105267144fcbad7386856405ef81a808782eeaad94acd0a2eb0fef488a08455","target":"record","created_at":"2026-07-05T11:19:31Z","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":"c4ff78ced6277de859fa2143e79b8212e42bcb6eec2ed66f848259199104266c","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T18:00:09Z","title_canon_sha256":"bce21280872ba7f7e29c648cf2ccadb698c45a5e668863cb69c4884e9156fb0e"},"schema_version":"1.0","source":{"id":"2506.09133","kind":"arxiv","version":1}},"canonical_sha256":"070ceaf228fefa12e695364527289b462e140bab3b104fbd1305c236da121a28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"070ceaf228fefa12e695364527289b462e140bab3b104fbd1305c236da121a28","first_computed_at":"2026-07-05T11:19:31.874649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:31.874649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5qBJXnt4rOSf1+liGvTAe6oaUAi3IN8tuLs06azcFkmJe/mV/WDwAUx9OI1R13W6zErQEXZyuTiph2dns22jCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:31.875109Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8105267144fcbad7386856405ef81a808782eeaad94acd0a2eb0fef488a08455","sha256:528888d0225aa4f595c74beb818cd7570956d6c9dccc4cd2017a1e656df21d00"],"state_sha256":"5ffee504133018c475043843a0dfc4381deab7d7ff8f2bcb586fd9441c9241fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXhCB9h6H5ENoMumdawNsg6colfdLsXjASiJtPoevcb8+YQ/VlktrGnXw8kX0t+zOsMkDvqUwCIlAMhlNmTdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:55:48.347199Z","bundle_sha256":"6e71e30dbd4eaa3cc63ccc3fa55a7f0b51ece4b0971165fc5346c9de654fbca7"}}