{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UI73PMUTQZ6HQWAUDOXXRRLDBG","short_pith_number":"pith:UI73PMUT","canonical_record":{"source":{"id":"2608.12574","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-12T20:38:51Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"97bbc9d6e40fe378f56905886dea911734a1652892d795457b1e9a67748b7648","abstract_canon_sha256":"0e4d2d375799e0d5f49554f0cf4f9b164f38061e47ecadfeb85519eb648dfa8c"},"schema_version":"1.0"},"canonical_sha256":"a23fb7b293867c7858141baf78c5630997f95d9cad0a99d9a23b107a1162f0e3","source":{"kind":"arxiv","id":"2608.12574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12574","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12574v1","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12574","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"UI73PMUTQZ6H","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_16","alias_value":"UI73PMUTQZ6HQWAU","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_8","alias_value":"UI73PMUT","created_at":"2026-08-14T00:45:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UI73PMUTQZ6HQWAUDOXXRRLDBG","target":"record","payload":{"canonical_record":{"source":{"id":"2608.12574","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-12T20:38:51Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"97bbc9d6e40fe378f56905886dea911734a1652892d795457b1e9a67748b7648","abstract_canon_sha256":"0e4d2d375799e0d5f49554f0cf4f9b164f38061e47ecadfeb85519eb648dfa8c"},"schema_version":"1.0"},"canonical_sha256":"a23fb7b293867c7858141baf78c5630997f95d9cad0a99d9a23b107a1162f0e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:45:16.724291Z","signature_b64":"0Bn7aCt746FqzmnolEHTSnmd5RYEaCPpA6cZ7cdKiWHBPhJrXILLerqA7zPjFRW0Vidr1e1rcqb3nG/UCA1LAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a23fb7b293867c7858141baf78c5630997f95d9cad0a99d9a23b107a1162f0e3","last_reissued_at":"2026-08-14T00:45:16.715686Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:45:16.715686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.12574","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-08-14T00:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWx3hn6LUIcng7PQ3CbQEzBukrs27ChdfIvlGEOkOta1iFNC5wATuOf1v1tOYCG2419ZMse7EGOZuogVI2RTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:28:33.512951Z"},"content_sha256":"200c1b3489095cda5a4039b86aee32ab00c13e32391d85fdeed582ff83a9b352","schema_version":"1.0","event_id":"sha256:200c1b3489095cda5a4039b86aee32ab00c13e32391d85fdeed582ff83a9b352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UI73PMUTQZ6HQWAUDOXXRRLDBG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trie Automata for Constrained Decoding over Large Finite Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.AI","authors_text":"Karim Bouyarmane, Xingzi Xu","submitted_at":"2026-08-12T20:38:51Z","abstract_excerpt":"Large language models increasingly need to generate structured outputs that conform to predefined schemas, with one common constraint being selection from a finite set of valid strings. Current constrained decoding systems handle this through general-purpose grammar compilation, which becomes prohibitively slow as the number of valid values grows into the thousands, a cardinality wall. We introduce the trie automaton, a specialized mechanism that exploits finite-set structure (shared prefixes, bounded depth, known cardinality) via Aho-Corasick multi-pattern matching to precompute per-node toke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12574","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/2608.12574/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-08-14T00:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJvX16KSlpQgR5mqUyneX9IpUjTFRc5jcJfUF+OZeZQAzauxVJjAecJzbUHa2HLLz9LxRy4h/DAAF2eTIzAmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T08:28:33.513275Z"},"content_sha256":"bc8a5aa48ae95ba219a5c6c54db4c14d77b618a6f19cd293d1c7d08353cb90cb","schema_version":"1.0","event_id":"sha256:bc8a5aa48ae95ba219a5c6c54db4c14d77b618a6f19cd293d1c7d08353cb90cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/bundle.json","state_url":"https://pith.science/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/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-20T08:28:33Z","links":{"resolver":"https://pith.science/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG","bundle":"https://pith.science/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/bundle.json","state":"https://pith.science/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UI73PMUTQZ6HQWAUDOXXRRLDBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UI73PMUTQZ6HQWAUDOXXRRLDBG","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":"0e4d2d375799e0d5f49554f0cf4f9b164f38061e47ecadfeb85519eb648dfa8c","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-12T20:38:51Z","title_canon_sha256":"97bbc9d6e40fe378f56905886dea911734a1652892d795457b1e9a67748b7648"},"schema_version":"1.0","source":{"id":"2608.12574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12574","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12574v1","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12574","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"UI73PMUTQZ6H","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_16","alias_value":"UI73PMUTQZ6HQWAU","created_at":"2026-08-14T00:45:16Z"},{"alias_kind":"pith_short_8","alias_value":"UI73PMUT","created_at":"2026-08-14T00:45:16Z"}],"graph_snapshots":[{"event_id":"sha256:bc8a5aa48ae95ba219a5c6c54db4c14d77b618a6f19cd293d1c7d08353cb90cb","target":"graph","created_at":"2026-08-14T00:45:16Z","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/2608.12574/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models increasingly need to generate structured outputs that conform to predefined schemas, with one common constraint being selection from a finite set of valid strings. Current constrained decoding systems handle this through general-purpose grammar compilation, which becomes prohibitively slow as the number of valid values grows into the thousands, a cardinality wall. We introduce the trie automaton, a specialized mechanism that exploits finite-set structure (shared prefixes, bounded depth, known cardinality) via Aho-Corasick multi-pattern matching to precompute per-node toke","authors_text":"Karim Bouyarmane, Xingzi Xu","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-12T20:38:51Z","title":"Trie Automata for Constrained Decoding over Large Finite Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12574","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:200c1b3489095cda5a4039b86aee32ab00c13e32391d85fdeed582ff83a9b352","target":"record","created_at":"2026-08-14T00:45:16Z","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":"0e4d2d375799e0d5f49554f0cf4f9b164f38061e47ecadfeb85519eb648dfa8c","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-08-12T20:38:51Z","title_canon_sha256":"97bbc9d6e40fe378f56905886dea911734a1652892d795457b1e9a67748b7648"},"schema_version":"1.0","source":{"id":"2608.12574","kind":"arxiv","version":1}},"canonical_sha256":"a23fb7b293867c7858141baf78c5630997f95d9cad0a99d9a23b107a1162f0e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a23fb7b293867c7858141baf78c5630997f95d9cad0a99d9a23b107a1162f0e3","first_computed_at":"2026-08-14T00:45:16.715686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T00:45:16.715686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Bn7aCt746FqzmnolEHTSnmd5RYEaCPpA6cZ7cdKiWHBPhJrXILLerqA7zPjFRW0Vidr1e1rcqb3nG/UCA1LAg==","signature_status":"signed_v1","signed_at":"2026-08-14T00:45:16.724291Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.12574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:200c1b3489095cda5a4039b86aee32ab00c13e32391d85fdeed582ff83a9b352","sha256:bc8a5aa48ae95ba219a5c6c54db4c14d77b618a6f19cd293d1c7d08353cb90cb"],"state_sha256":"0d8a1e4aebeaade4136cd7220faf2c6642a787315dfad913e9e47c628f1778cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBBFxHlNteJ0Tcz984bh+W88q0y4/1cj6hqsRTSY/hx8gUoO9yN50Ov3/3jyhh2rkfQV3/Q7TiJZV6CS2PR6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T08:28:33.516808Z","bundle_sha256":"c595df5450ba291d1c7f024685b14dbd35c5999adb84c61fa1a4c57b4d2d95c6"}}