{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6AL3DPS32GZM3NBWUAPPQQIISM","short_pith_number":"pith:6AL3DPS3","schema_version":"1.0","canonical_sha256":"f017b1be5bd1b2cdb436a01ef8410893352c8c64c7c2379e6152628da27ede5f","source":{"kind":"arxiv","id":"2606.19758","version":1},"attestation_state":"computed","paper":{"title":"SIGMA: Skill-Incidence Graphs for Compositional Multi-Agent Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Haoyue Liu, Kun Zeng, Siyue Chen, Siyu Zhang, Xiaoying Tang, Yuecheng Zhuo, Yu Huo, Yuquan Lu","submitted_at":"2026-06-18T03:41:16Z","abstract_excerpt":"Existing graph-based multi-agent system (MAS) designers mainly improve collaboration by optimizing communication topologies over predefined agents, roles, or groups. However, because each node remains a closed-set entity, these methods struggle to generalize to tasks that require unseen combinations of capabilities. We propose SIGMA, a skill-incidence graph framework that constructs agents as task-conditioned bundles of reusable skills. Given a task and a skill library, SIGMA predicts a skill-agent incidence matrix, composes agent node embeddings from selected skills, and decodes a communicati"},"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":"2606.19758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-06-18T03:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"0edab93101b4ff5d85133849fae79f32f059e174a9086b0f3a07b212691479e9","abstract_canon_sha256":"1f5d9f63c0314944f2f5e753642f154e7dfe52e71e84655fd482a9ee5a266ccb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:34.404117Z","signature_b64":"ZVwJ0zQ9jEbbGvYUBIeTsgFaURR3FV3nhBWbyhl6E5V5AFg7W5yHvgtngXMV0mhJA658tmyAa7pxWVW/G6TjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f017b1be5bd1b2cdb436a01ef8410893352c8c64c7c2379e6152628da27ede5f","last_reissued_at":"2026-06-19T16:12:34.403783Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:34.403783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIGMA: Skill-Incidence Graphs for Compositional Multi-Agent Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Haoyue Liu, Kun Zeng, Siyue Chen, Siyu Zhang, Xiaoying Tang, Yuecheng Zhuo, Yu Huo, Yuquan Lu","submitted_at":"2026-06-18T03:41:16Z","abstract_excerpt":"Existing graph-based multi-agent system (MAS) designers mainly improve collaboration by optimizing communication topologies over predefined agents, roles, or groups. However, because each node remains a closed-set entity, these methods struggle to generalize to tasks that require unseen combinations of capabilities. We propose SIGMA, a skill-incidence graph framework that constructs agents as task-conditioned bundles of reusable skills. Given a task and a skill library, SIGMA predicts a skill-agent incidence matrix, composes agent node embeddings from selected skills, and decodes a communicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19758","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/2606.19758/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":"2606.19758","created_at":"2026-06-19T16:12:34.403837+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19758v1","created_at":"2026-06-19T16:12:34.403837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19758","created_at":"2026-06-19T16:12:34.403837+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AL3DPS32GZM","created_at":"2026-06-19T16:12:34.403837+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AL3DPS32GZM3NBW","created_at":"2026-06-19T16:12:34.403837+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AL3DPS3","created_at":"2026-06-19T16:12:34.403837+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM","json":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM.json","graph_json":"https://pith.science/api/pith-number/6AL3DPS32GZM3NBWUAPPQQIISM/graph.json","events_json":"https://pith.science/api/pith-number/6AL3DPS32GZM3NBWUAPPQQIISM/events.json","paper":"https://pith.science/paper/6AL3DPS3"},"agent_actions":{"view_html":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM","download_json":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM.json","view_paper":"https://pith.science/paper/6AL3DPS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19758&json=true","fetch_graph":"https://pith.science/api/pith-number/6AL3DPS32GZM3NBWUAPPQQIISM/graph.json","fetch_events":"https://pith.science/api/pith-number/6AL3DPS32GZM3NBWUAPPQQIISM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM/action/storage_attestation","attest_author":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM/action/author_attestation","sign_citation":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM/action/citation_signature","submit_replication":"https://pith.science/pith/6AL3DPS32GZM3NBWUAPPQQIISM/action/replication_record"}},"created_at":"2026-06-19T16:12:34.403837+00:00","updated_at":"2026-06-19T16:12:34.403837+00:00"}