{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V4DEETW7MDACKT3FKEZD6SARKC","short_pith_number":"pith:V4DEETW7","schema_version":"1.0","canonical_sha256":"af06424edf60c0254f6551323f481150810a8d525089bf9d77c28ec213320657","source":{"kind":"arxiv","id":"2502.04306","version":1},"attestation_state":"computed","paper":{"title":"ScoreFlow: Mastering LLM Agent Workflows via Score-based Preference Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bryon Aragam, Guohao Li, Ling Yang, Mengdi Wang, Yinjie Wang","submitted_at":"2025-02-06T18:47:49Z","abstract_excerpt":"Recent research has leveraged large language model multi-agent systems for complex problem-solving while trying to reduce the manual effort required to build them, driving the development of automated agent workflow optimization methods. However, existing methods remain inflexible due to representational limitations, a lack of adaptability, and poor scalability when relying on discrete optimization techniques. We address these challenges with ScoreFlow, a simple yet high-performance framework that leverages efficient gradient-based optimization in a continuous space. ScoreFlow incorporates Sco"},"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":"2502.04306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-06T18:47:49Z","cross_cats_sorted":[],"title_canon_sha256":"e147be7ea9c52ed3f5dadfedd6c2b5e14997d38f76e1e4ba9b830d217319a00b","abstract_canon_sha256":"dd77f2aee972a2bb1b4ac84b2f728a009de1859226e481e96bfbc381ef684d3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:36.522854Z","signature_b64":"nxybGJa4BQy+p393p0xuLONnrhdOv2g+mPK2joW8+tcp3y19H4jyAZ1thr0o5LeFSmtdSkqJPLlc3fzXGmBSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af06424edf60c0254f6551323f481150810a8d525089bf9d77c28ec213320657","last_reissued_at":"2026-07-05T10:10:36.522398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:36.522398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ScoreFlow: Mastering LLM Agent Workflows via Score-based Preference Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bryon Aragam, Guohao Li, Ling Yang, Mengdi Wang, Yinjie Wang","submitted_at":"2025-02-06T18:47:49Z","abstract_excerpt":"Recent research has leveraged large language model multi-agent systems for complex problem-solving while trying to reduce the manual effort required to build them, driving the development of automated agent workflow optimization methods. However, existing methods remain inflexible due to representational limitations, a lack of adaptability, and poor scalability when relying on discrete optimization techniques. We address these challenges with ScoreFlow, a simple yet high-performance framework that leverages efficient gradient-based optimization in a continuous space. ScoreFlow incorporates Sco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04306","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/2502.04306/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":"2502.04306","created_at":"2026-07-05T10:10:36.522452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04306v1","created_at":"2026-07-05T10:10:36.522452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04306","created_at":"2026-07-05T10:10:36.522452+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4DEETW7MDAC","created_at":"2026-07-05T10:10:36.522452+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4DEETW7MDACKT3F","created_at":"2026-07-05T10:10:36.522452+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4DEETW7","created_at":"2026-07-05T10:10:36.522452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29790","citing_title":"Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22505","citing_title":"Towards Direct Evaluation of Harness Optimizers via Priority Ranking","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21035","citing_title":"GenoMAS: A Multi-Agent Framework for Scientific Discovery via Code-Driven Gene Expression Analysis","ref_index":126,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15034","citing_title":"Autogenesis: A Self-Evolving Agent Protocol","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11136","citing_title":"EVOCHAMBER: Test-Time Co-evolution of Multi-Agent System at Individual, Team, and Population Scales","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15034","citing_title":"Autogenesis: A Self-Evolving Agent Protocol","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC","json":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC.json","graph_json":"https://pith.science/api/pith-number/V4DEETW7MDACKT3FKEZD6SARKC/graph.json","events_json":"https://pith.science/api/pith-number/V4DEETW7MDACKT3FKEZD6SARKC/events.json","paper":"https://pith.science/paper/V4DEETW7"},"agent_actions":{"view_html":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC","download_json":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC.json","view_paper":"https://pith.science/paper/V4DEETW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04306&json=true","fetch_graph":"https://pith.science/api/pith-number/V4DEETW7MDACKT3FKEZD6SARKC/graph.json","fetch_events":"https://pith.science/api/pith-number/V4DEETW7MDACKT3FKEZD6SARKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC/action/storage_attestation","attest_author":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC/action/author_attestation","sign_citation":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC/action/citation_signature","submit_replication":"https://pith.science/pith/V4DEETW7MDACKT3FKEZD6SARKC/action/replication_record"}},"created_at":"2026-07-05T10:10:36.522452+00:00","updated_at":"2026-07-05T10:10:36.522452+00:00"}