{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5SOVDUSFFZGJASBGMF7KN5AQSQ","short_pith_number":"pith:5SOVDUSF","canonical_record":{"source":{"id":"2409.16275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-24T17:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"09a55109160c3e9e2f23a9a68fb06ed1a73140c34723547836a5b909f0f2e5aa","abstract_canon_sha256":"8ae6ae90a8149faf14f771c39fa2df4f3b0b4b2f5546dc2501137e42fc88ded3"},"schema_version":"1.0"},"canonical_sha256":"ec9d51d2452e4c904826617ea6f410940a48a7f71da0565168dc75505be9b03c","source":{"kind":"arxiv","id":"2409.16275","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.16275","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2409.16275v1","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.16275","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"5SOVDUSFFZGJ","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"5SOVDUSFFZGJASBG","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"5SOVDUSF","created_at":"2026-07-05T09:11:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5SOVDUSFFZGJASBGMF7KN5AQSQ","target":"record","payload":{"canonical_record":{"source":{"id":"2409.16275","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-24T17:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"09a55109160c3e9e2f23a9a68fb06ed1a73140c34723547836a5b909f0f2e5aa","abstract_canon_sha256":"8ae6ae90a8149faf14f771c39fa2df4f3b0b4b2f5546dc2501137e42fc88ded3"},"schema_version":"1.0"},"canonical_sha256":"ec9d51d2452e4c904826617ea6f410940a48a7f71da0565168dc75505be9b03c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:18.248138Z","signature_b64":"9CaprFkKAU7qYQbRzJzuFLv/ry6kqGWzcmbjgHkHW9XQ1Yik5A8auoEFBjvkgZ+H99WfQxbtFWEBZ5Jrq6v6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec9d51d2452e4c904826617ea6f410940a48a7f71da0565168dc75505be9b03c","last_reissued_at":"2026-07-05T09:11:18.247609Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:18.247609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.16275","source_version":1,"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-05T09:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XMuncFHTrfFo4jLcyaYLmBau0ru1kceO9BzM9N44wA7dYMZY3lO31Q/vGjZnhKp3MUtVehBKPTkPdysjDjXrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:45:16.187622Z"},"content_sha256":"7de737dd92d5892be28583e978d422f67fdba8c2cb0d628d3f9868057ca3e0f2","schema_version":"1.0","event_id":"sha256:7de737dd92d5892be28583e978d422f67fdba8c2cb0d628d3f9868057ca3e0f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5SOVDUSFFZGJASBGMF7KN5AQSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generative Factor Chaining: Coordinated Manipulation with Diffusion-based Factor Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Danfei Xu, Utkarsh A. Mishra, Yongxin Chen","submitted_at":"2024-09-24T17:47:34Z","abstract_excerpt":"Learning to plan for multi-step, multi-manipulator tasks is notoriously difficult because of the large search space and the complex constraint satisfaction problems. We present Generative Factor Chaining~(GFC), a composable generative model for planning. GFC represents a planning problem as a spatial-temporal factor graph, where nodes represent objects and robots in the scene, spatial factors capture the distributions of valid relationships among nodes, and temporal factors represent the distributions of skill transitions. Each factor is implemented as a modular diffusion model, which are comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.16275","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/2409.16275/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-05T09:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5Lw7CksJJGk9hjavig3Ivct183pLstkieqbEIjEc1WD4bqljIn6rDfDR7FKa0rgCsTMzCURw9aF54WDKyKqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:45:16.188515Z"},"content_sha256":"c72c8d28eb3363b0c4673e126a0c54161f1f90658f96d020f21d3e3234f657ae","schema_version":"1.0","event_id":"sha256:c72c8d28eb3363b0c4673e126a0c54161f1f90658f96d020f21d3e3234f657ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/bundle.json","state_url":"https://pith.science/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/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-04T13:45:16Z","links":{"resolver":"https://pith.science/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ","bundle":"https://pith.science/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/bundle.json","state":"https://pith.science/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SOVDUSFFZGJASBGMF7KN5AQSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5SOVDUSFFZGJASBGMF7KN5AQSQ","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":"8ae6ae90a8149faf14f771c39fa2df4f3b0b4b2f5546dc2501137e42fc88ded3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-24T17:47:34Z","title_canon_sha256":"09a55109160c3e9e2f23a9a68fb06ed1a73140c34723547836a5b909f0f2e5aa"},"schema_version":"1.0","source":{"id":"2409.16275","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.16275","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2409.16275v1","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.16275","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"5SOVDUSFFZGJ","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"5SOVDUSFFZGJASBG","created_at":"2026-07-05T09:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"5SOVDUSF","created_at":"2026-07-05T09:11:18Z"}],"graph_snapshots":[{"event_id":"sha256:c72c8d28eb3363b0c4673e126a0c54161f1f90658f96d020f21d3e3234f657ae","target":"graph","created_at":"2026-07-05T09:11:18Z","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/2409.16275/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning to plan for multi-step, multi-manipulator tasks is notoriously difficult because of the large search space and the complex constraint satisfaction problems. We present Generative Factor Chaining~(GFC), a composable generative model for planning. GFC represents a planning problem as a spatial-temporal factor graph, where nodes represent objects and robots in the scene, spatial factors capture the distributions of valid relationships among nodes, and temporal factors represent the distributions of skill transitions. Each factor is implemented as a modular diffusion model, which are comp","authors_text":"Danfei Xu, Utkarsh A. Mishra, Yongxin Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-24T17:47:34Z","title":"Generative Factor Chaining: Coordinated Manipulation with Diffusion-based Factor Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.16275","kind":"arxiv","version":1},"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:7de737dd92d5892be28583e978d422f67fdba8c2cb0d628d3f9868057ca3e0f2","target":"record","created_at":"2026-07-05T09:11:18Z","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":"8ae6ae90a8149faf14f771c39fa2df4f3b0b4b2f5546dc2501137e42fc88ded3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-24T17:47:34Z","title_canon_sha256":"09a55109160c3e9e2f23a9a68fb06ed1a73140c34723547836a5b909f0f2e5aa"},"schema_version":"1.0","source":{"id":"2409.16275","kind":"arxiv","version":1}},"canonical_sha256":"ec9d51d2452e4c904826617ea6f410940a48a7f71da0565168dc75505be9b03c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec9d51d2452e4c904826617ea6f410940a48a7f71da0565168dc75505be9b03c","first_computed_at":"2026-07-05T09:11:18.247609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:11:18.247609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9CaprFkKAU7qYQbRzJzuFLv/ry6kqGWzcmbjgHkHW9XQ1Yik5A8auoEFBjvkgZ+H99WfQxbtFWEBZ5Jrq6v6Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:11:18.248138Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.16275","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7de737dd92d5892be28583e978d422f67fdba8c2cb0d628d3f9868057ca3e0f2","sha256:c72c8d28eb3363b0c4673e126a0c54161f1f90658f96d020f21d3e3234f657ae"],"state_sha256":"a2d44b5b67b8aa8bed8290a2df754ad29a885cec01bef75b13b7e4cc083d93b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gsxRnpLQ95fIr9I0dHeSojXNRpq/BGljwg6SFm0YXiBurvrpawqCGixBjwq+md/pZAP+Ub0p36EL2Mc8wxCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:45:16.194308Z","bundle_sha256":"c1345d0dc0db81ced2b6a8fc80074a8a6f993b255c8ccf15f06c6d85c8fd565b"}}