{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y4FHJ6IGZHCNQ242W6GMK76VRR","short_pith_number":"pith:Y4FHJ6IG","schema_version":"1.0","canonical_sha256":"c70a74f906c9c4d86b9ab78cc57fd58c42ac4cf0f4254460ebebd6321419922f","source":{"kind":"arxiv","id":"2505.21963","version":1},"attestation_state":"computed","paper":{"title":"LaMDAgent: An Autonomous Framework for Post-Training Pipeline Optimization via LLM Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Masafumi Oyamada, Taro Yano, Yoichi Ishibashi","submitted_at":"2025-05-28T04:30:51Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated exceptional performance across a wide range of tasks. To further tailor LLMs to specific domains or applications, post-training techniques such as Supervised Fine-Tuning (SFT), Preference Learning, and model merging are commonly employed. While each of these methods has been extensively studied in isolation, the automated construction of complete post-training pipelines remains an underexplored area. Existing approaches typically rely on manual design or focus narrowly on optimizing individual components, such as data ordering or merging strategie"},"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":"2505.21963","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-05-28T04:30:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a1968b9eeebc7fad1bea04905065876eea9b7d0ce9d884e581545806869a42bf","abstract_canon_sha256":"cd453dea408198c0453749232abf07557e840ac47a84b172cd872b44a7e231b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:06.971392Z","signature_b64":"yIgpZ4WFhG1f1HTEC2CblbuH7L1xWIsqCMELJeOaFIFattEM9SGWCjgwrFZxAZIkFVI2Q3UAUOO9cqwY80ajCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c70a74f906c9c4d86b9ab78cc57fd58c42ac4cf0f4254460ebebd6321419922f","last_reissued_at":"2026-07-05T11:11:06.970897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:06.970897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LaMDAgent: An Autonomous Framework for Post-Training Pipeline Optimization via LLM Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Masafumi Oyamada, Taro Yano, Yoichi Ishibashi","submitted_at":"2025-05-28T04:30:51Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated exceptional performance across a wide range of tasks. To further tailor LLMs to specific domains or applications, post-training techniques such as Supervised Fine-Tuning (SFT), Preference Learning, and model merging are commonly employed. While each of these methods has been extensively studied in isolation, the automated construction of complete post-training pipelines remains an underexplored area. Existing approaches typically rely on manual design or focus narrowly on optimizing individual components, such as data ordering or merging strategie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21963","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/2505.21963/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":"2505.21963","created_at":"2026-07-05T11:11:06.970962+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21963v1","created_at":"2026-07-05T11:11:06.970962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21963","created_at":"2026-07-05T11:11:06.970962+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4FHJ6IGZHCN","created_at":"2026-07-05T11:11:06.970962+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4FHJ6IGZHCNQ242","created_at":"2026-07-05T11:11:06.970962+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4FHJ6IG","created_at":"2026-07-05T11:11:06.970962+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.05746","citing_title":"ARM: Discovering Agentic Reasoning Modules for Generalizable Multi-Agent Systems","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR","json":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR.json","graph_json":"https://pith.science/api/pith-number/Y4FHJ6IGZHCNQ242W6GMK76VRR/graph.json","events_json":"https://pith.science/api/pith-number/Y4FHJ6IGZHCNQ242W6GMK76VRR/events.json","paper":"https://pith.science/paper/Y4FHJ6IG"},"agent_actions":{"view_html":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR","download_json":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR.json","view_paper":"https://pith.science/paper/Y4FHJ6IG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21963&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4FHJ6IGZHCNQ242W6GMK76VRR/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4FHJ6IGZHCNQ242W6GMK76VRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR/action/storage_attestation","attest_author":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR/action/author_attestation","sign_citation":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR/action/citation_signature","submit_replication":"https://pith.science/pith/Y4FHJ6IGZHCNQ242W6GMK76VRR/action/replication_record"}},"created_at":"2026-07-05T11:11:06.970962+00:00","updated_at":"2026-07-05T11:11:06.970962+00:00"}