{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4UQ3FHUEP7S7AWTF5IEGTTMTY6","short_pith_number":"pith:4UQ3FHUE","schema_version":"1.0","canonical_sha256":"e521b29e847fe5f05a65ea0869cd93c79a452821e47c7328ce80347611c56a18","source":{"kind":"arxiv","id":"2605.00953","version":4},"attestation_state":"computed","paper":{"title":"Information Accessibility Limits in Structured NP Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polynomially many local queries cannot recover sparse violating subsets in near-P-matrix families with constant probability.","cross_cats":["cs.CC","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Jing-Yuan Wei","submitted_at":"2026-05-01T11:43:51Z","abstract_excerpt":"We study the problem of locating violating principal minors in matrix families lying near the boundary of P-matrices. Rather than viewing this search problem purely through computational complexity, we analyze it from an information-accessibility perspective.\n  We show that, despite strong underlying algebraic structure, the location of a violating subset may remain difficult to infer through local queries. In the sparse-violation regime, local observations typically provide only weak eliminative power, and polynomially many queries accumulate only vanishing mutual information about the hidden"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.00953","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-01T11:43:51Z","cross_cats_sorted":["cs.CC","math.IT","math.OC"],"title_canon_sha256":"423140d92fcc5c9c998f826dbce7c8039908fa1bf60c996ef05b242f9ffad90c","abstract_canon_sha256":"83596933bb8a40c4b4a72176504100a802e5e61c8bbd0b72dc63ad6aac9d6f7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:04.002865Z","signature_b64":"ksHuUghgPeQzj5GbBOXyW6StxJ7/uhu05BsNUybUy8Xm+2bOkoVirpwEaOUff16Kyoy2Dpy078VrWo2qvA8zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e521b29e847fe5f05a65ea0869cd93c79a452821e47c7328ce80347611c56a18","last_reissued_at":"2026-05-22T01:04:04.002007Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:04.002007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Accessibility Limits in Structured NP Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polynomially many local queries cannot recover sparse violating subsets in near-P-matrix families with constant probability.","cross_cats":["cs.CC","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Jing-Yuan Wei","submitted_at":"2026-05-01T11:43:51Z","abstract_excerpt":"We study the problem of locating violating principal minors in matrix families lying near the boundary of P-matrices. Rather than viewing this search problem purely through computational complexity, we analyze it from an information-accessibility perspective.\n  We show that, despite strong underlying algebraic structure, the location of a violating subset may remain difficult to infer through local queries. In the sparse-violation regime, local observations typically provide only weak eliminative power, and polynomially many queries accumulate only vanishing mutual information about the hidden"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"any algorithm restricted to polynomially many queries cannot recover the violating subset with constant success probability.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The restricted interaction model in which queries provide only local information that does not capture the globally encoded location of the violating subset.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In structured P-matrix families with sparse violations, the violating subset cannot be recovered with constant success probability using polynomially many local queries due to an information-theoretic bottleneck.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Polynomially many local queries cannot recover sparse violating subsets in near-P-matrix families with constant probability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"1640cac97b2a3c158b66e5695dc4b48625833fedfeeea61471a2210e9d8d9796"},"source":{"id":"2605.00953","kind":"arxiv","version":4},"verdict":{"id":"05d1e1f5-13fb-4b24-9b6d-f1522c932ab6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T18:58:21.571308Z","strongest_claim":"any algorithm restricted to polynomially many queries cannot recover the violating subset with constant success probability.","one_line_summary":"In structured P-matrix families with sparse violations, the violating subset cannot be recovered with constant success probability using polynomially many local queries due to an information-theoretic bottleneck.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The restricted interaction model in which queries provide only local information that does not capture the globally encoded location of the violating subset.","pith_extraction_headline":"Polynomially many local queries cannot recover sparse violating subsets in near-P-matrix families with constant probability."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.00953/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T19:39:24.686175Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T18:02:16.192194Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"92fd90e5ed1de5734643a90a90bbb785dc620ee84b6ea2b313c349749f2752de"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.00953","created_at":"2026-05-22T01:04:04.002121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.00953v4","created_at":"2026-05-22T01:04:04.002121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.00953","created_at":"2026-05-22T01:04:04.002121+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UQ3FHUEP7S7","created_at":"2026-05-22T01:04:04.002121+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UQ3FHUEP7S7AWTF","created_at":"2026-05-22T01:04:04.002121+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UQ3FHUE","created_at":"2026-05-22T01:04:04.002121+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20236","citing_title":"Information Redistribution Under Reductions in NP Search","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6","json":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6.json","graph_json":"https://pith.science/api/pith-number/4UQ3FHUEP7S7AWTF5IEGTTMTY6/graph.json","events_json":"https://pith.science/api/pith-number/4UQ3FHUEP7S7AWTF5IEGTTMTY6/events.json","paper":"https://pith.science/paper/4UQ3FHUE"},"agent_actions":{"view_html":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6","download_json":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6.json","view_paper":"https://pith.science/paper/4UQ3FHUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.00953&json=true","fetch_graph":"https://pith.science/api/pith-number/4UQ3FHUEP7S7AWTF5IEGTTMTY6/graph.json","fetch_events":"https://pith.science/api/pith-number/4UQ3FHUEP7S7AWTF5IEGTTMTY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6/action/storage_attestation","attest_author":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6/action/author_attestation","sign_citation":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6/action/citation_signature","submit_replication":"https://pith.science/pith/4UQ3FHUEP7S7AWTF5IEGTTMTY6/action/replication_record"}},"created_at":"2026-05-22T01:04:04.002121+00:00","updated_at":"2026-05-22T01:04:04.002121+00:00"}