{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KDAPFGBCA47NUZYAF4RO77H73W","short_pith_number":"pith:KDAPFGBC","schema_version":"1.0","canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","source":{"kind":"arxiv","id":"2606.08698","version":1},"attestation_state":"computed","paper":{"title":"Quotient Admission Algorithms for Witness-Supported Graph Windows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yushan Li","submitted_at":"2026-06-07T15:53:21Z","abstract_excerpt":"We formulate the quotient admission problem for finite graph-window rows. The input is a finite row set, an admissible evidence map, semantic labels, witness-support hypergraphs, and atom-level admissibility predicates. The output is a quotient decision on evidence atoms, with possible decisions certificate, residual, low-confidence, or blocked. The problem asks for the maximal guard-respecting atom-level decision map that uses no refinement beyond the admissible evidence partition. We prove an atom-union characterization of identifiable classes, give a witness-support hypergraph guard for cer"},"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":"2606.08698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T15:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"43d3fcd5add4224133b0cda1910682a713bcc5e0dc4a34108eb193a33edb5a65","abstract_canon_sha256":"d9a87ec0bab38b48e6298aad606219fde1144861a896336fd4a232f902e97415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:47.759362Z","signature_b64":"i5sGc7HEpckz9TcFBuCKcXWAHPamZltZpCEh0POBP1ce7ZfMxL6i/Qcq35B9V/fAIj2mehSUtK+sJcmCmC7BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","last_reissued_at":"2026-06-09T01:05:47.758892Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:47.758892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quotient Admission Algorithms for Witness-Supported Graph Windows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yushan Li","submitted_at":"2026-06-07T15:53:21Z","abstract_excerpt":"We formulate the quotient admission problem for finite graph-window rows. The input is a finite row set, an admissible evidence map, semantic labels, witness-support hypergraphs, and atom-level admissibility predicates. The output is a quotient decision on evidence atoms, with possible decisions certificate, residual, low-confidence, or blocked. The problem asks for the maximal guard-respecting atom-level decision map that uses no refinement beyond the admissible evidence partition. We prove an atom-union characterization of identifiable classes, give a witness-support hypergraph guard for cer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08698","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.08698/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.08698","created_at":"2026-06-09T01:05:47.758947+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08698v1","created_at":"2026-06-09T01:05:47.758947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08698","created_at":"2026-06-09T01:05:47.758947+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDAPFGBCA47N","created_at":"2026-06-09T01:05:47.758947+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDAPFGBCA47NUZYA","created_at":"2026-06-09T01:05:47.758947+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDAPFGBC","created_at":"2026-06-09T01:05:47.758947+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W","json":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W.json","graph_json":"https://pith.science/api/pith-number/KDAPFGBCA47NUZYAF4RO77H73W/graph.json","events_json":"https://pith.science/api/pith-number/KDAPFGBCA47NUZYAF4RO77H73W/events.json","paper":"https://pith.science/paper/KDAPFGBC"},"agent_actions":{"view_html":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W","download_json":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W.json","view_paper":"https://pith.science/paper/KDAPFGBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08698&json=true","fetch_graph":"https://pith.science/api/pith-number/KDAPFGBCA47NUZYAF4RO77H73W/graph.json","fetch_events":"https://pith.science/api/pith-number/KDAPFGBCA47NUZYAF4RO77H73W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/action/storage_attestation","attest_author":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/action/author_attestation","sign_citation":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/action/citation_signature","submit_replication":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/action/replication_record"}},"created_at":"2026-06-09T01:05:47.758947+00:00","updated_at":"2026-06-09T01:05:47.758947+00:00"}