{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SMZWD3OWZD5PPBKHBKZQAUYZMB","short_pith_number":"pith:SMZWD3OW","schema_version":"1.0","canonical_sha256":"933361edd6c8faf785470ab30053196063be0b30b09438d837e902e03f9c7524","source":{"kind":"arxiv","id":"2207.04364","version":4},"attestation_state":"computed","paper":{"title":"Sequential Manipulation Planning on Scene Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Hangxin Liu, Song-Chun Zhu, Yida Niu, Yixin Zhu, Zeyu Zhang, Ziyuan Jiao","submitted_at":"2022-07-10T02:01:33Z","abstract_excerpt":"We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Augmented with predicate-like attributes, this contact graph-based representation abstracts scene layouts with succinct geometric information and valid robot-scene interactions. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with a stochastic optimization method. A task plan is then initialized by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations"},"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":"2207.04364","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-07-10T02:01:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"18ace88c9c03606ba958e4703cd3746561599d9ac44287e4afe3bf96b3a7e97a","abstract_canon_sha256":"1b9d49b87280848cdb72cd6a49fa4ddadcb9115364d7bb86f5183113eb9b6a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:55.227750Z","signature_b64":"rTTpF8waDn5GDymvtFlr/CysXy/9ArSx9FZfxx9R7OZgR2iI170DZgk/uZ7h1ou+jo0ig+jqTSkQBRVX75O8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"933361edd6c8faf785470ab30053196063be0b30b09438d837e902e03f9c7524","last_reissued_at":"2026-07-05T04:40:55.227362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:55.227362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Manipulation Planning on Scene Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Hangxin Liu, Song-Chun Zhu, Yida Niu, Yixin Zhu, Zeyu Zhang, Ziyuan Jiao","submitted_at":"2022-07-10T02:01:33Z","abstract_excerpt":"We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Augmented with predicate-like attributes, this contact graph-based representation abstracts scene layouts with succinct geometric information and valid robot-scene interactions. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with a stochastic optimization method. A task plan is then initialized by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04364","kind":"arxiv","version":4},"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/2207.04364/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":"2207.04364","created_at":"2026-07-05T04:40:55.227419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.04364v4","created_at":"2026-07-05T04:40:55.227419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04364","created_at":"2026-07-05T04:40:55.227419+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMZWD3OWZD5P","created_at":"2026-07-05T04:40:55.227419+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMZWD3OWZD5PPBKH","created_at":"2026-07-05T04:40:55.227419+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMZWD3OW","created_at":"2026-07-05T04:40:55.227419+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/SMZWD3OWZD5PPBKHBKZQAUYZMB","json":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB.json","graph_json":"https://pith.science/api/pith-number/SMZWD3OWZD5PPBKHBKZQAUYZMB/graph.json","events_json":"https://pith.science/api/pith-number/SMZWD3OWZD5PPBKHBKZQAUYZMB/events.json","paper":"https://pith.science/paper/SMZWD3OW"},"agent_actions":{"view_html":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB","download_json":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB.json","view_paper":"https://pith.science/paper/SMZWD3OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.04364&json=true","fetch_graph":"https://pith.science/api/pith-number/SMZWD3OWZD5PPBKHBKZQAUYZMB/graph.json","fetch_events":"https://pith.science/api/pith-number/SMZWD3OWZD5PPBKHBKZQAUYZMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB/action/storage_attestation","attest_author":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB/action/author_attestation","sign_citation":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB/action/citation_signature","submit_replication":"https://pith.science/pith/SMZWD3OWZD5PPBKHBKZQAUYZMB/action/replication_record"}},"created_at":"2026-07-05T04:40:55.227419+00:00","updated_at":"2026-07-05T04:40:55.227419+00:00"}