{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5SQVB75ABEDGFKZMBGKB73CMPF","short_pith_number":"pith:5SQVB75A","canonical_record":{"source":{"id":"2504.07247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-09T19:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"54d80a539ba435f9f136c54109506d70f0b765221c43713c9e2eae26d74fb1d7","abstract_canon_sha256":"e06d098e78521258c8a821d212de90c8fc3f6c3b3d80c8a46747b3e3af82388c"},"schema_version":"1.0"},"canonical_sha256":"eca150ffa0090662ab2c09941fec4c7978a2b13b91edde4e5bbe6368404895d3","source":{"kind":"arxiv","id":"2504.07247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07247","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07247v2","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07247","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"5SQVB75ABEDG","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_16","alias_value":"5SQVB75ABEDGFKZM","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_8","alias_value":"5SQVB75A","created_at":"2026-07-05T11:51:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5SQVB75ABEDGFKZMBGKB73CMPF","target":"record","payload":{"canonical_record":{"source":{"id":"2504.07247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-09T19:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"54d80a539ba435f9f136c54109506d70f0b765221c43713c9e2eae26d74fb1d7","abstract_canon_sha256":"e06d098e78521258c8a821d212de90c8fc3f6c3b3d80c8a46747b3e3af82388c"},"schema_version":"1.0"},"canonical_sha256":"eca150ffa0090662ab2c09941fec4c7978a2b13b91edde4e5bbe6368404895d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:25.182531Z","signature_b64":"51MCyjHQzzGLctYmT2dcGnbZ+I1v/LojQP1/j/eZmR6GyaSpOuT5LxJQPMEra20YGlTTrUk4O++rkG4jsXkKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eca150ffa0090662ab2c09941fec4c7978a2b13b91edde4e5bbe6368404895d3","last_reissued_at":"2026-07-05T11:51:25.182006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:25.182006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.07247","source_version":2,"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-05T11:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zu0oM56cxsiLUSyZlt7zy5jcnavE53eaisA9ocjWcfEAQVhWFgp+4IE10o4gB31wiq0/2iAEMDOdGv2hhl/UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:54:56.658082Z"},"content_sha256":"43945ba496444a06bb809cf16116fc2667857527a5e406a56e6b6140c02dfbb2","schema_version":"1.0","event_id":"sha256:43945ba496444a06bb809cf16116fc2667857527a5e406a56e6b6140c02dfbb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5SQVB75ABEDGFKZMBGKB73CMPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource-efficient Inference with Foundation Model Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chris Jermaine, Kevin Yu, Lunyiu Nie, Marco Cheung, Swarat Chaudhuri, Zhimin Ding","submitted_at":"2025-04-09T19:36:47Z","abstract_excerpt":"The inference-time resource costs of large language and vision models present a growing challenge in production deployments. We propose the use of foundation model programs, i.e., programs that can invoke foundation models with varying resource costs and performance, as an approach to this problem. Specifically, we present a method that translates a task into a program, then learns a policy for resource allocation that, on each input, selects foundation model \"backends\" for each program module. The policy uses smaller, cheaper backends to handle simpler subtasks, while allowing more complex su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07247","kind":"arxiv","version":2},"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/2504.07247/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-05T11:51:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82mqtpfOsXae38jpxT/oon6EIDvBhn9vk/Z4ldA6N21/Il02jxTp/aO/dL7e6oXG8SEFiQeO6S5HsjsHeqJABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:54:56.658595Z"},"content_sha256":"2aae84a18ded1792f07551a07a463b0b5cd85d15a281f47ded278e0e7f695be3","schema_version":"1.0","event_id":"sha256:2aae84a18ded1792f07551a07a463b0b5cd85d15a281f47ded278e0e7f695be3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SQVB75ABEDGFKZMBGKB73CMPF/bundle.json","state_url":"https://pith.science/pith/5SQVB75ABEDGFKZMBGKB73CMPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SQVB75ABEDGFKZMBGKB73CMPF/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-11T07:54:56Z","links":{"resolver":"https://pith.science/pith/5SQVB75ABEDGFKZMBGKB73CMPF","bundle":"https://pith.science/pith/5SQVB75ABEDGFKZMBGKB73CMPF/bundle.json","state":"https://pith.science/pith/5SQVB75ABEDGFKZMBGKB73CMPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SQVB75ABEDGFKZMBGKB73CMPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5SQVB75ABEDGFKZMBGKB73CMPF","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":"e06d098e78521258c8a821d212de90c8fc3f6c3b3d80c8a46747b3e3af82388c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-09T19:36:47Z","title_canon_sha256":"54d80a539ba435f9f136c54109506d70f0b765221c43713c9e2eae26d74fb1d7"},"schema_version":"1.0","source":{"id":"2504.07247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.07247","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"2504.07247v2","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07247","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"5SQVB75ABEDG","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_16","alias_value":"5SQVB75ABEDGFKZM","created_at":"2026-07-05T11:51:25Z"},{"alias_kind":"pith_short_8","alias_value":"5SQVB75A","created_at":"2026-07-05T11:51:25Z"}],"graph_snapshots":[{"event_id":"sha256:2aae84a18ded1792f07551a07a463b0b5cd85d15a281f47ded278e0e7f695be3","target":"graph","created_at":"2026-07-05T11:51:25Z","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/2504.07247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The inference-time resource costs of large language and vision models present a growing challenge in production deployments. We propose the use of foundation model programs, i.e., programs that can invoke foundation models with varying resource costs and performance, as an approach to this problem. Specifically, we present a method that translates a task into a program, then learns a policy for resource allocation that, on each input, selects foundation model \"backends\" for each program module. The policy uses smaller, cheaper backends to handle simpler subtasks, while allowing more complex su","authors_text":"Chris Jermaine, Kevin Yu, Lunyiu Nie, Marco Cheung, Swarat Chaudhuri, Zhimin Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-09T19:36:47Z","title":"Resource-efficient Inference with Foundation Model Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07247","kind":"arxiv","version":2},"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:43945ba496444a06bb809cf16116fc2667857527a5e406a56e6b6140c02dfbb2","target":"record","created_at":"2026-07-05T11:51:25Z","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":"e06d098e78521258c8a821d212de90c8fc3f6c3b3d80c8a46747b3e3af82388c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-09T19:36:47Z","title_canon_sha256":"54d80a539ba435f9f136c54109506d70f0b765221c43713c9e2eae26d74fb1d7"},"schema_version":"1.0","source":{"id":"2504.07247","kind":"arxiv","version":2}},"canonical_sha256":"eca150ffa0090662ab2c09941fec4c7978a2b13b91edde4e5bbe6368404895d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eca150ffa0090662ab2c09941fec4c7978a2b13b91edde4e5bbe6368404895d3","first_computed_at":"2026-07-05T11:51:25.182006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:25.182006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"51MCyjHQzzGLctYmT2dcGnbZ+I1v/LojQP1/j/eZmR6GyaSpOuT5LxJQPMEra20YGlTTrUk4O++rkG4jsXkKBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:25.182531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.07247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43945ba496444a06bb809cf16116fc2667857527a5e406a56e6b6140c02dfbb2","sha256:2aae84a18ded1792f07551a07a463b0b5cd85d15a281f47ded278e0e7f695be3"],"state_sha256":"d281732fb0a92bcd24e140542819694bf6ae13fe860f62f40158b67db86aed21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86e6/SqG/s7auRjMlgrbxINdBg6BSFb8gPvsnX2LIsakGX5sr7Z4f9425kU+vjJjwCWkZryNc08nu238zjWOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T07:54:56.663076Z","bundle_sha256":"bb8bea0c4f040d7b32609d5a76a818eb39d6775fa8f085fd9cefc321e34a82b8"}}