{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J7VJAOBKIQ4635ZZCI2HIKNAZZ","short_pith_number":"pith:J7VJAOBK","schema_version":"1.0","canonical_sha256":"4fea90382a4439edf73912347429a0ce7496818ae1ecfc908287f280021191c3","source":{"kind":"arxiv","id":"2409.03346","version":1},"attestation_state":"computed","paper":{"title":"Sketch: A Toolkit for Streamlining LLM Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aixin Sun, Jing Li, Naitong Yu, Peng Han, Wenjia Ma, Xiang Li, Xin Jiang, Xuezhi Fang, Xuying Meng, Yequan Wang, Yiqun Yao","submitted_at":"2024-09-05T08:45:44Z","abstract_excerpt":"Large language models (LLMs) represented by GPT family have achieved remarkable success. The characteristics of LLMs lie in their ability to accommodate a wide range of tasks through a generative approach. However, the flexibility of their output format poses challenges in controlling and harnessing the model's outputs, thereby constraining the application of LLMs in various domains. In this work, we present Sketch, an innovative toolkit designed to streamline LLM operations across diverse fields. Sketch comprises the following components: (1) a suite of task description schemas and prompt tem"},"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":"2409.03346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-09-05T08:45:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0a38f7dd3bad22bee9ed78f8c86104d8e49e86bd1473d47f1d4bfe055ad8fc23","abstract_canon_sha256":"707172652005d16ec2f8fe8b76829684f26be11cc4170be60d26cc804dbcf025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:29.990452Z","signature_b64":"8Apxz7rR/hbd9uodAdMdBIVI6qg++OTGk8Tcaupbg+P3JHo5Kjvrpvg0yJEMGAiWXfJ6GNIMMH0WFJpzknDlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fea90382a4439edf73912347429a0ce7496818ae1ecfc908287f280021191c3","last_reissued_at":"2026-07-05T09:03:29.989915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:29.989915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sketch: A Toolkit for Streamlining LLM Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Aixin Sun, Jing Li, Naitong Yu, Peng Han, Wenjia Ma, Xiang Li, Xin Jiang, Xuezhi Fang, Xuying Meng, Yequan Wang, Yiqun Yao","submitted_at":"2024-09-05T08:45:44Z","abstract_excerpt":"Large language models (LLMs) represented by GPT family have achieved remarkable success. The characteristics of LLMs lie in their ability to accommodate a wide range of tasks through a generative approach. However, the flexibility of their output format poses challenges in controlling and harnessing the model's outputs, thereby constraining the application of LLMs in various domains. In this work, we present Sketch, an innovative toolkit designed to streamline LLM operations across diverse fields. Sketch comprises the following components: (1) a suite of task description schemas and prompt tem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.03346","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/2409.03346/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":"2409.03346","created_at":"2026-07-05T09:03:29.989972+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.03346v1","created_at":"2026-07-05T09:03:29.989972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.03346","created_at":"2026-07-05T09:03:29.989972+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7VJAOBKIQ46","created_at":"2026-07-05T09:03:29.989972+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7VJAOBKIQ4635ZZ","created_at":"2026-07-05T09:03:29.989972+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7VJAOBK","created_at":"2026-07-05T09:03:29.989972+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01151","citing_title":"Earley-Driven Dynamic Pruning for Efficient Structured Decoding","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ","json":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ.json","graph_json":"https://pith.science/api/pith-number/J7VJAOBKIQ4635ZZCI2HIKNAZZ/graph.json","events_json":"https://pith.science/api/pith-number/J7VJAOBKIQ4635ZZCI2HIKNAZZ/events.json","paper":"https://pith.science/paper/J7VJAOBK"},"agent_actions":{"view_html":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ","download_json":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ.json","view_paper":"https://pith.science/paper/J7VJAOBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.03346&json=true","fetch_graph":"https://pith.science/api/pith-number/J7VJAOBKIQ4635ZZCI2HIKNAZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/J7VJAOBKIQ4635ZZCI2HIKNAZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ/action/storage_attestation","attest_author":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ/action/author_attestation","sign_citation":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ/action/citation_signature","submit_replication":"https://pith.science/pith/J7VJAOBKIQ4635ZZCI2HIKNAZZ/action/replication_record"}},"created_at":"2026-07-05T09:03:29.989972+00:00","updated_at":"2026-07-05T09:03:29.989972+00:00"}