{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:464T7KWPKQSZJM5435X4TGT4NU","short_pith_number":"pith:464T7KWP","canonical_record":{"source":{"id":"2607.06145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-07T11:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"57271ad01a989e8cf0f6c34e629902f477a1102bb986a8abd6261d598533c631","abstract_canon_sha256":"52b6e570b2f0fbc09c46e51b9dd24205baae2db7cdce003aae264d500af43b1b"},"schema_version":"1.0"},"canonical_sha256":"e7b93faacf542594b3bcdf6fc99a7c6d1e1ba78f652dbea1911071b5cb4cb1d2","source":{"kind":"arxiv","id":"2607.06145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06145","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06145v1","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06145","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"464T7KWPKQSZ","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"464T7KWPKQSZJM54","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"464T7KWP","created_at":"2026-07-08T01:18:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:464T7KWPKQSZJM5435X4TGT4NU","target":"record","payload":{"canonical_record":{"source":{"id":"2607.06145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-07T11:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"57271ad01a989e8cf0f6c34e629902f477a1102bb986a8abd6261d598533c631","abstract_canon_sha256":"52b6e570b2f0fbc09c46e51b9dd24205baae2db7cdce003aae264d500af43b1b"},"schema_version":"1.0"},"canonical_sha256":"e7b93faacf542594b3bcdf6fc99a7c6d1e1ba78f652dbea1911071b5cb4cb1d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:58.360448Z","signature_b64":"wFxXMlkH9a2K9ZTQotcyWQ7pWEjhPtodod/SqPUSBuK5lGr9nYibnKyKTGtphs/ap1t8HnSn2V6XXl9x4HEtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b93faacf542594b3bcdf6fc99a7c6d1e1ba78f652dbea1911071b5cb4cb1d2","last_reissued_at":"2026-07-08T01:18:58.360013Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:58.360013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.06145","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-07-08T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAEIKIDAniUsdmBGjr4laGjcjx0eKx5ajWopDEuSBzhk22jcbWsurnkmm1Xe0Xlu9ayJU4TbOY47GXFxVRNQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:47:35.307725Z"},"content_sha256":"e73f3ca276189403562c0ced4c2cd270f1d1bdfec03e1c3da3aa17334389548e","schema_version":"1.0","event_id":"sha256:e73f3ca276189403562c0ced4c2cd270f1d1bdfec03e1c3da3aa17334389548e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:464T7KWPKQSZJM5435X4TGT4NU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prompting Complexity: Shortest Prompts for Texts and Behaviors in LLMs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adrian Cosma","submitted_at":"2026-07-07T11:12:44Z","abstract_excerpt":"In this paper, we define the quantity of prompting complexity: for a fixed instruction-tuned language model, what is the shortest plausible prompt that makes deterministic decoding produce a target text? It is an LM-relative analogue of resource-bounded Kolmogorov complexity: the prompt is a program, the model interface is the interpreter, and information omitted from the prompt is supplied by the model's weights, training distribution, tokenizer, template, and decoding rule. Unlike classical Kolmogorov complexity, this measure is intentionally non-universal. In the finite-context setting it i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06145","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/2607.06145/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-07-08T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJP4ceUoJHCGlyCtzpwKG5KH97qyki1gIV/KbJ2OjgDBqUcSkZ9ZLEWjzj5mJeXUECjk1DPNrK+eaLewvdKvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:47:35.308306Z"},"content_sha256":"a6605f70f5b0975486a99d056fa3ab3621716b01fb87e50a239953232491534a","schema_version":"1.0","event_id":"sha256:a6605f70f5b0975486a99d056fa3ab3621716b01fb87e50a239953232491534a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/464T7KWPKQSZJM5435X4TGT4NU/bundle.json","state_url":"https://pith.science/pith/464T7KWPKQSZJM5435X4TGT4NU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/464T7KWPKQSZJM5435X4TGT4NU/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-10T14:47:35Z","links":{"resolver":"https://pith.science/pith/464T7KWPKQSZJM5435X4TGT4NU","bundle":"https://pith.science/pith/464T7KWPKQSZJM5435X4TGT4NU/bundle.json","state":"https://pith.science/pith/464T7KWPKQSZJM5435X4TGT4NU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/464T7KWPKQSZJM5435X4TGT4NU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:464T7KWPKQSZJM5435X4TGT4NU","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":"52b6e570b2f0fbc09c46e51b9dd24205baae2db7cdce003aae264d500af43b1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-07T11:12:44Z","title_canon_sha256":"57271ad01a989e8cf0f6c34e629902f477a1102bb986a8abd6261d598533c631"},"schema_version":"1.0","source":{"id":"2607.06145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.06145","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"2607.06145v1","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06145","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"464T7KWPKQSZ","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_16","alias_value":"464T7KWPKQSZJM54","created_at":"2026-07-08T01:18:58Z"},{"alias_kind":"pith_short_8","alias_value":"464T7KWP","created_at":"2026-07-08T01:18:58Z"}],"graph_snapshots":[{"event_id":"sha256:a6605f70f5b0975486a99d056fa3ab3621716b01fb87e50a239953232491534a","target":"graph","created_at":"2026-07-08T01:18:58Z","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/2607.06145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we define the quantity of prompting complexity: for a fixed instruction-tuned language model, what is the shortest plausible prompt that makes deterministic decoding produce a target text? It is an LM-relative analogue of resource-bounded Kolmogorov complexity: the prompt is a program, the model interface is the interpreter, and information omitted from the prompt is supplied by the model's weights, training distribution, tokenizer, template, and decoding rule. Unlike classical Kolmogorov complexity, this measure is intentionally non-universal. In the finite-context setting it i","authors_text":"Adrian Cosma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-07T11:12:44Z","title":"Prompting Complexity: Shortest Prompts for Texts and Behaviors in LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06145","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:e73f3ca276189403562c0ced4c2cd270f1d1bdfec03e1c3da3aa17334389548e","target":"record","created_at":"2026-07-08T01:18:58Z","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":"52b6e570b2f0fbc09c46e51b9dd24205baae2db7cdce003aae264d500af43b1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2026-07-07T11:12:44Z","title_canon_sha256":"57271ad01a989e8cf0f6c34e629902f477a1102bb986a8abd6261d598533c631"},"schema_version":"1.0","source":{"id":"2607.06145","kind":"arxiv","version":1}},"canonical_sha256":"e7b93faacf542594b3bcdf6fc99a7c6d1e1ba78f652dbea1911071b5cb4cb1d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b93faacf542594b3bcdf6fc99a7c6d1e1ba78f652dbea1911071b5cb4cb1d2","first_computed_at":"2026-07-08T01:18:58.360013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:58.360013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFxXMlkH9a2K9ZTQotcyWQ7pWEjhPtodod/SqPUSBuK5lGr9nYibnKyKTGtphs/ap1t8HnSn2V6XXl9x4HEtBA==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:58.360448Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.06145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73f3ca276189403562c0ced4c2cd270f1d1bdfec03e1c3da3aa17334389548e","sha256:a6605f70f5b0975486a99d056fa3ab3621716b01fb87e50a239953232491534a"],"state_sha256":"3d178271ba617494dbe6e6a6b1a20e12a0c4a3fd3bc12af92be2aa5e98ffd928"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85pW/D85OVp/KqI1VsmBLXbbINAQ+eiPYr/avYNL1TA8QsVptaLbWHFKdmvxRsnXFpmNG3Yt3EgBwh+JsFHzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:47:35.313461Z","bundle_sha256":"eb4b9d8d52e6f1e7414f5824dc479a888d6f6740251ee54e0433ea4d2f78ed76"}}