{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U2LBWSNCZCL67SRQELHVXT6XA6","short_pith_number":"pith:U2LBWSNC","canonical_record":{"source":{"id":"2606.20399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-18T15:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"21d47990b6dda48ba92f5e9481833a2df494ad3e33f5165ce558638c75c4c61b","abstract_canon_sha256":"a5a5b2763453065f80c78e5526c82f4fbd9a9403356c60c6e53865887ee3ac04"},"schema_version":"1.0"},"canonical_sha256":"a6961b49a2c897efca3022cf5bcfd7078788481fc11a791ade40a1019cc47571","source":{"kind":"arxiv","id":"2606.20399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20399","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20399v1","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20399","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"U2LBWSNCZCL6","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"U2LBWSNCZCL67SRQ","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"U2LBWSNC","created_at":"2026-06-19T16:13:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U2LBWSNCZCL67SRQELHVXT6XA6","target":"record","payload":{"canonical_record":{"source":{"id":"2606.20399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-18T15:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"21d47990b6dda48ba92f5e9481833a2df494ad3e33f5165ce558638c75c4c61b","abstract_canon_sha256":"a5a5b2763453065f80c78e5526c82f4fbd9a9403356c60c6e53865887ee3ac04"},"schema_version":"1.0"},"canonical_sha256":"a6961b49a2c897efca3022cf5bcfd7078788481fc11a791ade40a1019cc47571","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:11.598912Z","signature_b64":"M762y2I0NGRfeZO4pwahfv05ZbAOIx2Q/ePSNMZVqfSnRITDVxFR1vVoAWTGXamA8gZjNuqnCb5eIlsokiDTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6961b49a2c897efca3022cf5bcfd7078788481fc11a791ade40a1019cc47571","last_reissued_at":"2026-06-19T16:13:11.598516Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:11.598516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.20399","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-06-19T16:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zR2cKrbfaudkI8R1NuLJi+vz+n+oWi02MvSjS05kpshaaxsq/oIFDp4HqwpjFOZWZrJloWSFvpEKWldBbHcLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:11:46.699999Z"},"content_sha256":"2fe09aee75f92d39337b733176b8e9c8737fdb2bc094696c4282f6d85dccfa1b","schema_version":"1.0","event_id":"sha256:2fe09aee75f92d39337b733176b8e9c8737fdb2bc094696c4282f6d85dccfa1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U2LBWSNCZCL67SRQELHVXT6XA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Benjamin Carleton, Conor Taliancich, David E. Narv\\'aez, Lane A. Hemaspaandra, Melissa Welsh, Michael C. Chavrimootoo","submitted_at":"2026-06-18T15:52:47Z","abstract_excerpt":"Ambiguity-bounded versions of $\\mathrm{NP}$, denoted $\\mathrm{UP}_{\\leq f(n)}$, bound by $f(n)$ the number of accepting paths the nondeterministic polynomial-time Turing machine can have on inputs of length $n$. Such classes range from Valiant's completely unambiguous ($f(n)=1$) class $\\mathrm{UP}$ to $\\mathrm{NP}$ itself, where there is no bound or, equivalently, there is the toothless exponential bound ($f(n) = 2^{n^{O(1)}}$).\n  This paper seeks to understand which of these classes stand and fall together as to whether they equal deterministic polynomial time. Informally put, what ranges of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20399","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/2606.20399/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-06-19T16:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"twiahPtVPpnDAlzfF43FWHe2Aabi44NIPOEgFDYjqlpp5S3pxmJseMCp6W5lrqeWbrWp8arVxhB3LM1noBXABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:11:46.700382Z"},"content_sha256":"977125e2cccba11440b614acb142facc20b6fd46a471de83cc7d7d2da92f40de","schema_version":"1.0","event_id":"sha256:977125e2cccba11440b614acb142facc20b6fd46a471de83cc7d7d2da92f40de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2LBWSNCZCL67SRQELHVXT6XA6/bundle.json","state_url":"https://pith.science/pith/U2LBWSNCZCL67SRQELHVXT6XA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2LBWSNCZCL67SRQELHVXT6XA6/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-21T12:11:46Z","links":{"resolver":"https://pith.science/pith/U2LBWSNCZCL67SRQELHVXT6XA6","bundle":"https://pith.science/pith/U2LBWSNCZCL67SRQELHVXT6XA6/bundle.json","state":"https://pith.science/pith/U2LBWSNCZCL67SRQELHVXT6XA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2LBWSNCZCL67SRQELHVXT6XA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U2LBWSNCZCL67SRQELHVXT6XA6","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":"a5a5b2763453065f80c78e5526c82f4fbd9a9403356c60c6e53865887ee3ac04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-18T15:52:47Z","title_canon_sha256":"21d47990b6dda48ba92f5e9481833a2df494ad3e33f5165ce558638c75c4c61b"},"schema_version":"1.0","source":{"id":"2606.20399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20399","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20399v1","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20399","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"U2LBWSNCZCL6","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"U2LBWSNCZCL67SRQ","created_at":"2026-06-19T16:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"U2LBWSNC","created_at":"2026-06-19T16:13:11Z"}],"graph_snapshots":[{"event_id":"sha256:977125e2cccba11440b614acb142facc20b6fd46a471de83cc7d7d2da92f40de","target":"graph","created_at":"2026-06-19T16:13:11Z","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/2606.20399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ambiguity-bounded versions of $\\mathrm{NP}$, denoted $\\mathrm{UP}_{\\leq f(n)}$, bound by $f(n)$ the number of accepting paths the nondeterministic polynomial-time Turing machine can have on inputs of length $n$. Such classes range from Valiant's completely unambiguous ($f(n)=1$) class $\\mathrm{UP}$ to $\\mathrm{NP}$ itself, where there is no bound or, equivalently, there is the toothless exponential bound ($f(n) = 2^{n^{O(1)}}$).\n  This paper seeks to understand which of these classes stand and fall together as to whether they equal deterministic polynomial time. Informally put, what ranges of ","authors_text":"Benjamin Carleton, Conor Taliancich, David E. Narv\\'aez, Lane A. Hemaspaandra, Melissa Welsh, Michael C. Chavrimootoo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-18T15:52:47Z","title":"Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20399","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:2fe09aee75f92d39337b733176b8e9c8737fdb2bc094696c4282f6d85dccfa1b","target":"record","created_at":"2026-06-19T16:13:11Z","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":"a5a5b2763453065f80c78e5526c82f4fbd9a9403356c60c6e53865887ee3ac04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-06-18T15:52:47Z","title_canon_sha256":"21d47990b6dda48ba92f5e9481833a2df494ad3e33f5165ce558638c75c4c61b"},"schema_version":"1.0","source":{"id":"2606.20399","kind":"arxiv","version":1}},"canonical_sha256":"a6961b49a2c897efca3022cf5bcfd7078788481fc11a791ade40a1019cc47571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6961b49a2c897efca3022cf5bcfd7078788481fc11a791ade40a1019cc47571","first_computed_at":"2026-06-19T16:13:11.598516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:11.598516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M762y2I0NGRfeZO4pwahfv05ZbAOIx2Q/ePSNMZVqfSnRITDVxFR1vVoAWTGXamA8gZjNuqnCb5eIlsokiDTBw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:11.598912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fe09aee75f92d39337b733176b8e9c8737fdb2bc094696c4282f6d85dccfa1b","sha256:977125e2cccba11440b614acb142facc20b6fd46a471de83cc7d7d2da92f40de"],"state_sha256":"2952a99875cb9a8ac6ff8c3bbc7c79b9836e6681c7b6bc6260afe0b646b6bda7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lvrt2D8Hu0EX+TixZUO4KphLUKGFyROg7s63J3LuHV5H1OjkDLPnalSyIyU8TcsTxLXxnaF+h16rXL6IJ6H1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:11:46.702412Z","bundle_sha256":"87d6d597b41c6afe5651df039999a296eb01b9c6e371e9c662d432e9a1217dac"}}