{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KDAPFGBCA47NUZYAF4RO77H73W","short_pith_number":"pith:KDAPFGBC","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"},"canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","source":{"kind":"arxiv","id":"2606.08698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08698","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08698v1","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08698","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"KDAPFGBCA47N","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"KDAPFGBCA47NUZYA","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"KDAPFGBC","created_at":"2026-06-09T01:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KDAPFGBCA47NUZYAF4RO77H73W","target":"record","payload":{"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"},"canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","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"},"source_kind":"arxiv","source_id":"2606.08698","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-09T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmIQEOGCs6NW0VXh5DL5BI9XBxSY5EMbCRD6mczzn0dMMv/n+UYs8bFt9in9O4BpBGBvq6BozJlssYVmJslBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:23:54.344521Z"},"content_sha256":"bd23251869d0cd1b3871fad2f976c22778da55685390bef33dca840c675ecbe1","schema_version":"1.0","event_id":"sha256:bd23251869d0cd1b3871fad2f976c22778da55685390bef33dca840c675ecbe1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KDAPFGBCA47NUZYAF4RO77H73W","target":"graph","payload":{"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"},"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-09T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Bp+Dm8v2TFCgGZO//aI0dZyDsyZDtJJl0DzvUVtSyp3OQn74MGLmpIaZEY/W7cq3nMKA2+PjW5Zm8boEfu9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:23:54.344901Z"},"content_sha256":"c6fdc0e9863194f3bff1bd3e6f38e2b39b7172239a6b73e5caeed22cd4dab037","schema_version":"1.0","event_id":"sha256:c6fdc0e9863194f3bff1bd3e6f38e2b39b7172239a6b73e5caeed22cd4dab037"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/bundle.json","state_url":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDAPFGBCA47NUZYAF4RO77H73W/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-23T03:23:54Z","links":{"resolver":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W","bundle":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/bundle.json","state":"https://pith.science/pith/KDAPFGBCA47NUZYAF4RO77H73W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDAPFGBCA47NUZYAF4RO77H73W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KDAPFGBCA47NUZYAF4RO77H73W","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":"d9a87ec0bab38b48e6298aad606219fde1144861a896336fd4a232f902e97415","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T15:53:21Z","title_canon_sha256":"43d3fcd5add4224133b0cda1910682a713bcc5e0dc4a34108eb193a33edb5a65"},"schema_version":"1.0","source":{"id":"2606.08698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08698","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08698v1","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08698","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"KDAPFGBCA47N","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"KDAPFGBCA47NUZYA","created_at":"2026-06-09T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"KDAPFGBC","created_at":"2026-06-09T01:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:c6fdc0e9863194f3bff1bd3e6f38e2b39b7172239a6b73e5caeed22cd4dab037","target":"graph","created_at":"2026-06-09T01:05:47Z","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.08698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Yushan Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T15:53:21Z","title":"Quotient Admission Algorithms for Witness-Supported Graph Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08698","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:bd23251869d0cd1b3871fad2f976c22778da55685390bef33dca840c675ecbe1","target":"record","created_at":"2026-06-09T01:05:47Z","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":"d9a87ec0bab38b48e6298aad606219fde1144861a896336fd4a232f902e97415","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-07T15:53:21Z","title_canon_sha256":"43d3fcd5add4224133b0cda1910682a713bcc5e0dc4a34108eb193a33edb5a65"},"schema_version":"1.0","source":{"id":"2606.08698","kind":"arxiv","version":1}},"canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50c0f29822073eda67002f22effcffdd8be8dac6c4394223ecaa4770908f945a","first_computed_at":"2026-06-09T01:05:47.758892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:47.758892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i5sGc7HEpckz9TcFBuCKcXWAHPamZltZpCEh0POBP1ce7ZfMxL6i/Qcq35B9V/fAIj2mehSUtK+sJcmCmC7BBA==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:47.759362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd23251869d0cd1b3871fad2f976c22778da55685390bef33dca840c675ecbe1","sha256:c6fdc0e9863194f3bff1bd3e6f38e2b39b7172239a6b73e5caeed22cd4dab037"],"state_sha256":"8d2aebd400432934d59f99caecd557b5c8faf9c3237fc74a188e0189f99b999c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26a5YqPTrY5tzEYwxxtqfW7XDaefBRsZtfwqaACtbSed4peVMxSgn2UQTaRLc2FZeOhu0rhtJR8d2nHNcX25BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:23:54.346961Z","bundle_sha256":"2704581882b90666f30db551ebd9d3e73575a31362e89c505b1b3aae036e8420"}}