{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XFW475FF5KQRTIDF3LEWZ6LJTU","short_pith_number":"pith:XFW475FF","schema_version":"1.0","canonical_sha256":"b96dcff4a5eaa119a065dac96cf9699d0fe3789b2f3a09160ab012efb887ac1c","source":{"kind":"arxiv","id":"2301.13279","version":1},"attestation_state":"computed","paper":{"title":"Learning Coordination Policies over Heterogeneous Graphs for Human-Robot Teams via Recurrent Neural Schedule Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Batuhan Altundas, Joshua Bishop, Matthew Gombolay, Zheyuan Wang","submitted_at":"2023-01-30T20:42:06Z","abstract_excerpt":"As human-robot collaboration increases in the workforce, it becomes essential for human-robot teams to coordinate efficiently and intuitively. Traditional approaches for human-robot scheduling either utilize exact methods that are intractable for large-scale problems and struggle to account for stochastic, time varying human task performance, or application-specific heuristics that require expert domain knowledge to develop. We propose a deep learning-based framework, called HybridNet, combining a heterogeneous graph-based encoder with a recurrent schedule propagator for scheduling stochastic "},"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":"2301.13279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-01-30T20:42:06Z","cross_cats_sorted":["cs.LG","cs.MA","cs.RO"],"title_canon_sha256":"5ec6d5b244c4b34edb5837a45400f73e2004c82af4a58e0fb101e493a174854f","abstract_canon_sha256":"3a02aae970de0a3e3150d2eef1b8930da460ea5dea0420811eaf967ad01ac69a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:13.166662Z","signature_b64":"yn9G6IAcDM9PRQ8uylMeP4/i6T03+EzjzaAEwgOSGCIl6EOKmPbays2pEl9Udw1XhiNscZ8sgSOWLUzqq5OzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96dcff4a5eaa119a065dac96cf9699d0fe3789b2f3a09160ab012efb887ac1c","last_reissued_at":"2026-07-05T05:37:13.166108Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:13.166108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Coordination Policies over Heterogeneous Graphs for Human-Robot Teams via Recurrent Neural Schedule Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Batuhan Altundas, Joshua Bishop, Matthew Gombolay, Zheyuan Wang","submitted_at":"2023-01-30T20:42:06Z","abstract_excerpt":"As human-robot collaboration increases in the workforce, it becomes essential for human-robot teams to coordinate efficiently and intuitively. Traditional approaches for human-robot scheduling either utilize exact methods that are intractable for large-scale problems and struggle to account for stochastic, time varying human task performance, or application-specific heuristics that require expert domain knowledge to develop. We propose a deep learning-based framework, called HybridNet, combining a heterogeneous graph-based encoder with a recurrent schedule propagator for scheduling stochastic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13279","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/2301.13279/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":"2301.13279","created_at":"2026-07-05T05:37:13.166166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.13279v1","created_at":"2026-07-05T05:37:13.166166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13279","created_at":"2026-07-05T05:37:13.166166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFW475FF5KQR","created_at":"2026-07-05T05:37:13.166166+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFW475FF5KQRTIDF","created_at":"2026-07-05T05:37:13.166166+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFW475FF","created_at":"2026-07-05T05:37:13.166166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05526","citing_title":"Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU","json":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU.json","graph_json":"https://pith.science/api/pith-number/XFW475FF5KQRTIDF3LEWZ6LJTU/graph.json","events_json":"https://pith.science/api/pith-number/XFW475FF5KQRTIDF3LEWZ6LJTU/events.json","paper":"https://pith.science/paper/XFW475FF"},"agent_actions":{"view_html":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU","download_json":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU.json","view_paper":"https://pith.science/paper/XFW475FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.13279&json=true","fetch_graph":"https://pith.science/api/pith-number/XFW475FF5KQRTIDF3LEWZ6LJTU/graph.json","fetch_events":"https://pith.science/api/pith-number/XFW475FF5KQRTIDF3LEWZ6LJTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU/action/storage_attestation","attest_author":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU/action/author_attestation","sign_citation":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU/action/citation_signature","submit_replication":"https://pith.science/pith/XFW475FF5KQRTIDF3LEWZ6LJTU/action/replication_record"}},"created_at":"2026-07-05T05:37:13.166166+00:00","updated_at":"2026-07-05T05:37:13.166166+00:00"}