{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KY4VY3XXPNERGWEUTATMRCLUH5","short_pith_number":"pith:KY4VY3XX","schema_version":"1.0","canonical_sha256":"56395c6ef77b491358949826c889743f442505bf9ce1f7ef7cd2bef17e615c58","source":{"kind":"arxiv","id":"2506.14580","version":1},"attestation_state":"computed","paper":{"title":"GenerationPrograms: Fine-grained Attribution with Executable Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"David Wan, Elias Stengel-Eskin, Eran Hirsch, Ido Dagan, Mohit Bansal","submitted_at":"2025-06-17T14:37:09Z","abstract_excerpt":"Recent large language models (LLMs) achieve impressive performance in source-conditioned text generation but often fail to correctly provide fine-grained attributions for their outputs, undermining verifiability and trust. Moreover, existing attribution methods do not explain how and why models leverage the provided source documents to generate their final responses, limiting interpretability. To overcome these challenges, we introduce a modular generation framework, GenerationPrograms, inspired by recent advancements in executable \"code agent\" architectures. Unlike conventional generation met"},"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":"2506.14580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-17T14:37:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"80e77913c103f73ad769884f9803d56003373e12c4ba5bffb3a6bd27eae0b0c0","abstract_canon_sha256":"cbb99478cc51f8910634f8247aaf4a8dca9e8b307398fb641c2f769663dac04e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:59.205329Z","signature_b64":"oXQ3s8GSasAqRe3uDJ/EIQWH0q1iceuP7oxISC5tw+XAsB8KS6e1bNUdiDbQJxCb2yWZD5vv6SUvGuMyz+uWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56395c6ef77b491358949826c889743f442505bf9ce1f7ef7cd2bef17e615c58","last_reissued_at":"2026-07-05T11:22:59.204779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:59.204779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GenerationPrograms: Fine-grained Attribution with Executable Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"David Wan, Elias Stengel-Eskin, Eran Hirsch, Ido Dagan, Mohit Bansal","submitted_at":"2025-06-17T14:37:09Z","abstract_excerpt":"Recent large language models (LLMs) achieve impressive performance in source-conditioned text generation but often fail to correctly provide fine-grained attributions for their outputs, undermining verifiability and trust. Moreover, existing attribution methods do not explain how and why models leverage the provided source documents to generate their final responses, limiting interpretability. To overcome these challenges, we introduce a modular generation framework, GenerationPrograms, inspired by recent advancements in executable \"code agent\" architectures. Unlike conventional generation met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.14580","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/2506.14580/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":"2506.14580","created_at":"2026-07-05T11:22:59.204845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.14580v1","created_at":"2026-07-05T11:22:59.204845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.14580","created_at":"2026-07-05T11:22:59.204845+00:00"},{"alias_kind":"pith_short_12","alias_value":"KY4VY3XXPNER","created_at":"2026-07-05T11:22:59.204845+00:00"},{"alias_kind":"pith_short_16","alias_value":"KY4VY3XXPNERGWEU","created_at":"2026-07-05T11:22:59.204845+00:00"},{"alias_kind":"pith_short_8","alias_value":"KY4VY3XX","created_at":"2026-07-05T11:22:59.204845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18037","citing_title":"ProvenanceGuard: Source-Aware Factuality Verification for MCP-Based LLM Agents","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06635","citing_title":"Cited but Not Verified: Parsing and Evaluating Source Attribution in LLM Deep Research Agents","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5","json":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5.json","graph_json":"https://pith.science/api/pith-number/KY4VY3XXPNERGWEUTATMRCLUH5/graph.json","events_json":"https://pith.science/api/pith-number/KY4VY3XXPNERGWEUTATMRCLUH5/events.json","paper":"https://pith.science/paper/KY4VY3XX"},"agent_actions":{"view_html":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5","download_json":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5.json","view_paper":"https://pith.science/paper/KY4VY3XX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.14580&json=true","fetch_graph":"https://pith.science/api/pith-number/KY4VY3XXPNERGWEUTATMRCLUH5/graph.json","fetch_events":"https://pith.science/api/pith-number/KY4VY3XXPNERGWEUTATMRCLUH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5/action/storage_attestation","attest_author":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5/action/author_attestation","sign_citation":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5/action/citation_signature","submit_replication":"https://pith.science/pith/KY4VY3XXPNERGWEUTATMRCLUH5/action/replication_record"}},"created_at":"2026-07-05T11:22:59.204845+00:00","updated_at":"2026-07-05T11:22:59.204845+00:00"}