{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZDIRMS4BXZBCCA6EJQLKOEWWBE","short_pith_number":"pith:ZDIRMS4B","canonical_record":{"source":{"id":"2604.04295","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-05T22:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"7d9d2c36963318dad2f7e0f3b4e804b290261f3a7be7769caa59273a44c889ff","abstract_canon_sha256":"4e4dbcef878f88a1ca64609fbaa02b852f2349152dfd13fb31c431079b68920a"},"schema_version":"1.0"},"canonical_sha256":"c8d1164b81be422103c44c16a712d60933aa9c9345fd37dbcdffc5f1a6208c88","source":{"kind":"arxiv","id":"2604.04295","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04295","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04295v3","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04295","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZDIRMS4BXZBC","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"ZDIRMS4BXZBCCA6E","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"ZDIRMS4B","created_at":"2026-05-28T01:04:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZDIRMS4BXZBCCA6EJQLKOEWWBE","target":"record","payload":{"canonical_record":{"source":{"id":"2604.04295","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-05T22:25:36Z","cross_cats_sorted":[],"title_canon_sha256":"7d9d2c36963318dad2f7e0f3b4e804b290261f3a7be7769caa59273a44c889ff","abstract_canon_sha256":"4e4dbcef878f88a1ca64609fbaa02b852f2349152dfd13fb31c431079b68920a"},"schema_version":"1.0"},"canonical_sha256":"c8d1164b81be422103c44c16a712d60933aa9c9345fd37dbcdffc5f1a6208c88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:39.456546Z","signature_b64":"2hCrbI7v8IlesXtF+cOxnnycOD403x9T4816j1effQKq4af2VhJIPQU4TAKOeILJwMnYUCtsiM9M5k72XQVHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d1164b81be422103c44c16a712d60933aa9c9345fd37dbcdffc5f1a6208c88","last_reissued_at":"2026-05-28T01:04:39.455898Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:39.455898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.04295","source_version":3,"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-05-28T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddt2jG6n1jS8zhqSAXr3f31POt0VbuhZkkBFPTyh3kKtT+gnMCkjQ1YpxKihz/iZNbl/x7QxaAgI7GUNUMdbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:17:16.454138Z"},"content_sha256":"3292e0d6baf92109ef575708f14b1ba77a7e7704c6696eee7cd27f8dd361f438","schema_version":"1.0","event_id":"sha256:3292e0d6baf92109ef575708f14b1ba77a7e7704c6696eee7cd27f8dd361f438"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZDIRMS4BXZBCCA6EJQLKOEWWBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Cost-Efficient Evaluation for Reliable Patent Claim Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Longbing Cao, Qiongkai Xu, Yongmin Yoo","submitted_at":"2026-04-05T22:25:36Z","abstract_excerpt":"Automated patent claim validation demands low error tolerance. However, existing approaches face a rigidity-resource dilemma: lightweight encoders cannot track long-range legal dependencies, while exhaustive LLM verification incurs 4-5X higher overhead at million-claim scale. A naive confidence-based cascade cannot resolve this because binary validity scores fail to distinguish structurally distinct error types which require different reasoning depths. We propose a two-stage framework: Adaptive Cost-efficient Evaluation (ACE), which exploits the categorical structure of patent errors for uncer"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On our constructed benchmark, ACE achieves the best F1 among the evaluated methods at 94.95% while reducing operational costs by 78% compared to standalone LLM deployments. Crucially, the entropy-based routing threshold transfers directly to authentic USPTO §112(b) rejections without re-calibration.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Predictive entropy from the lightweight encoder reliably flags claims that require LLM-level review for long-range legal dependencies, and the CoPT protocol enables the LLM to resolve those dependencies effectively without additional fine-tuning or calibration.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ACE achieves 94.95% F1 on patent claim validation by routing high-entropy cases to an LLM with CoPT reasoning, cutting costs 78% versus full LLM use, with the threshold transferring to real USPTO rejections.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e272aac39bef5cc717e87d63b0c8ee736cb6a5e184424b2386507f061eaed3e4"},"source":{"id":"2604.04295","kind":"arxiv","version":3},"verdict":{"id":"537cf0b7-8c6e-4212-b76e-67819fbf28f0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:59:02.580771Z","strongest_claim":"On our constructed benchmark, ACE achieves the best F1 among the evaluated methods at 94.95% while reducing operational costs by 78% compared to standalone LLM deployments. Crucially, the entropy-based routing threshold transfers directly to authentic USPTO §112(b) rejections without re-calibration.","one_line_summary":"ACE achieves 94.95% F1 on patent claim validation by routing high-entropy cases to an LLM with CoPT reasoning, cutting costs 78% versus full LLM use, with the threshold transferring to real USPTO rejections.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Predictive entropy from the lightweight encoder reliably flags claims that require LLM-level review for long-range legal dependencies, and the CoPT protocol enables the LLM to resolve those dependencies effectively without additional fine-tuning or calibration.","pith_extraction_headline":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.04295/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":"537cf0b7-8c6e-4212-b76e-67819fbf28f0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"22kNR6L7YTwF/NC06PVE0j6N8i7LfSuY3nLfYMdlyJIgzG/VY2QWgscm2A+jQPGAF6OD8wH0t0BJQCGoN8XRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:17:16.454631Z"},"content_sha256":"2bf0e80a7efd3caa69d83b506c0aa41dcfd0f06c2faf822e14147ea06167c625","schema_version":"1.0","event_id":"sha256:2bf0e80a7efd3caa69d83b506c0aa41dcfd0f06c2faf822e14147ea06167c625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/bundle.json","state_url":"https://pith.science/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/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-23T16:17:16Z","links":{"resolver":"https://pith.science/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE","bundle":"https://pith.science/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/bundle.json","state":"https://pith.science/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDIRMS4BXZBCCA6EJQLKOEWWBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZDIRMS4BXZBCCA6EJQLKOEWWBE","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":"4e4dbcef878f88a1ca64609fbaa02b852f2349152dfd13fb31c431079b68920a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-05T22:25:36Z","title_canon_sha256":"7d9d2c36963318dad2f7e0f3b4e804b290261f3a7be7769caa59273a44c889ff"},"schema_version":"1.0","source":{"id":"2604.04295","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04295","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04295v3","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04295","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZDIRMS4BXZBC","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_16","alias_value":"ZDIRMS4BXZBCCA6E","created_at":"2026-05-28T01:04:39Z"},{"alias_kind":"pith_short_8","alias_value":"ZDIRMS4B","created_at":"2026-05-28T01:04:39Z"}],"graph_snapshots":[{"event_id":"sha256:2bf0e80a7efd3caa69d83b506c0aa41dcfd0f06c2faf822e14147ea06167c625","target":"graph","created_at":"2026-05-28T01:04:39Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On our constructed benchmark, ACE achieves the best F1 among the evaluated methods at 94.95% while reducing operational costs by 78% compared to standalone LLM deployments. Crucially, the entropy-based routing threshold transfers directly to authentic USPTO §112(b) rejections without re-calibration."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Predictive entropy from the lightweight encoder reliably flags claims that require LLM-level review for long-range legal dependencies, and the CoPT protocol enables the LLM to resolve those dependencies effectively without additional fine-tuning or calibration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ACE achieves 94.95% F1 on patent claim validation by routing high-entropy cases to an LLM with CoPT reasoning, cutting costs 78% versus full LLM use, with the threshold transferring to real USPTO rejections."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost."}],"snapshot_sha256":"e272aac39bef5cc717e87d63b0c8ee736cb6a5e184424b2386507f061eaed3e4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.04295/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automated patent claim validation demands low error tolerance. However, existing approaches face a rigidity-resource dilemma: lightweight encoders cannot track long-range legal dependencies, while exhaustive LLM verification incurs 4-5X higher overhead at million-claim scale. A naive confidence-based cascade cannot resolve this because binary validity scores fail to distinguish structurally distinct error types which require different reasoning depths. We propose a two-stage framework: Adaptive Cost-efficient Evaluation (ACE), which exploits the categorical structure of patent errors for uncer","authors_text":"Longbing Cao, Qiongkai Xu, Yongmin Yoo","cross_cats":[],"headline":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-05T22:25:36Z","title":"Adaptive Cost-Efficient Evaluation for Reliable Patent Claim Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.04295","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-14T21:59:02.580771Z","id":"537cf0b7-8c6e-4212-b76e-67819fbf28f0","model_set":{"reader":"grok-4.3"},"one_line_summary":"ACE achieves 94.95% F1 on patent claim validation by routing high-entropy cases to an LLM with CoPT reasoning, cutting costs 78% versus full LLM use, with the threshold transferring to real USPTO rejections.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Hybrid system routes uncertain patent claims to LLMs via entropy, hitting 94.95% F1 at 78% lower cost.","strongest_claim":"On our constructed benchmark, ACE achieves the best F1 among the evaluated methods at 94.95% while reducing operational costs by 78% compared to standalone LLM deployments. Crucially, the entropy-based routing threshold transfers directly to authentic USPTO §112(b) rejections without re-calibration.","weakest_assumption":"Predictive entropy from the lightweight encoder reliably flags claims that require LLM-level review for long-range legal dependencies, and the CoPT protocol enables the LLM to resolve those dependencies effectively without additional fine-tuning or calibration."}},"verdict_id":"537cf0b7-8c6e-4212-b76e-67819fbf28f0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3292e0d6baf92109ef575708f14b1ba77a7e7704c6696eee7cd27f8dd361f438","target":"record","created_at":"2026-05-28T01:04:39Z","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":"4e4dbcef878f88a1ca64609fbaa02b852f2349152dfd13fb31c431079b68920a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-04-05T22:25:36Z","title_canon_sha256":"7d9d2c36963318dad2f7e0f3b4e804b290261f3a7be7769caa59273a44c889ff"},"schema_version":"1.0","source":{"id":"2604.04295","kind":"arxiv","version":3}},"canonical_sha256":"c8d1164b81be422103c44c16a712d60933aa9c9345fd37dbcdffc5f1a6208c88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8d1164b81be422103c44c16a712d60933aa9c9345fd37dbcdffc5f1a6208c88","first_computed_at":"2026-05-28T01:04:39.455898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:39.455898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2hCrbI7v8IlesXtF+cOxnnycOD403x9T4816j1effQKq4af2VhJIPQU4TAKOeILJwMnYUCtsiM9M5k72XQVHBA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:39.456546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.04295","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3292e0d6baf92109ef575708f14b1ba77a7e7704c6696eee7cd27f8dd361f438","sha256:2bf0e80a7efd3caa69d83b506c0aa41dcfd0f06c2faf822e14147ea06167c625"],"state_sha256":"c2ae0b8a98b572ec275e7a832efc0950e88e9fd7063c0a8f29c5841fe3f43457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ln49PjLCMZ3VoF/tTNLLvEV1WkQP9ELgoaPw1wwCHoIAZnBp4BqaLpOp5p31fFRQ623WmVDtEybpMooKTo3ECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:17:16.456930Z","bundle_sha256":"83a83bb03b461485c48a66462b77c7f0910e15a3f55bb6d37c19bc111cb839c5"}}