{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HG7AZDPHAXECTVX5AICJN4BELA","short_pith_number":"pith:HG7AZDPH","canonical_record":{"source":{"id":"1511.07209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-11-23T13:04:47Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"cca1ae338a21abbb12545aaefe5b7af04676767d47cf8e1da4c321219427d288","abstract_canon_sha256":"61b877f165153b828a086c0045efbabdc56cbbda41d374f30decc88dab00466f"},"schema_version":"1.0"},"canonical_sha256":"39be0c8de705c829d6fd020496f024581170a6d06a0cc96d2a6a839de25ed0ed","source":{"kind":"arxiv","id":"1511.07209","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07209","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07209v2","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07209","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"HG7AZDPHAXEC","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HG7AZDPHAXECTVX5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HG7AZDPH","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HG7AZDPHAXECTVX5AICJN4BELA","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07209","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-11-23T13:04:47Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"cca1ae338a21abbb12545aaefe5b7af04676767d47cf8e1da4c321219427d288","abstract_canon_sha256":"61b877f165153b828a086c0045efbabdc56cbbda41d374f30decc88dab00466f"},"schema_version":"1.0"},"canonical_sha256":"39be0c8de705c829d6fd020496f024581170a6d06a0cc96d2a6a839de25ed0ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:20.206045Z","signature_b64":"aYcCY3ZIuzGidMTeETI6zZL8WDCE0JHm4gFVdLi+59MEQDIAZ68uzhdIQXA/HdHkjyMtwFACJ4VLy2BxyWAvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39be0c8de705c829d6fd020496f024581170a6d06a0cc96d2a6a839de25ed0ed","last_reissued_at":"2026-05-18T01:10:20.205452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:20.205452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07209","source_version":2,"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-05-18T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bVo/Jufyf+iCNpgR/HLO3si7kYyq6ne/FUTrEaRWajWJBacormoQcDpty1Ik44yEF9bAVpq5k+JLjsmQraxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:19:23.236346Z"},"content_sha256":"ea1d1d24520902ec59d705e1c9da5d240839e3bd9be97a5c994e68b52c7f7e6e","schema_version":"1.0","event_id":"sha256:ea1d1d24520902ec59d705e1c9da5d240839e3bd9be97a5c994e68b52c7f7e6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HG7AZDPHAXECTVX5AICJN4BELA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Agent Continuous Transportation with Online Balanced Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Chao Wang, Kian Hsiang Low, Somchaya Liemhetcharat","submitted_at":"2015-11-23T13:04:47Z","abstract_excerpt":"We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a final destination. The goal is to maximize the rate of transportation while the objects are replenished over time. Examples of problems that need continuous transportation are foraging, area sweeping, and first/last mile problem. Previous approaches typically neglect the interference and are highly dependent on communications among agents. Some also incor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07209","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zj9ZBzbYMdENaBavL6OhdoVALJJ+S9WpInGTFBgm0agcFJ/7TlfAnzM9c6jFuuKrf4ySTPcKiT9kZKws+M8UBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:19:23.236701Z"},"content_sha256":"30f16d9c3232ad68388845ab6d4a905734d4fd6770387e2548ae19538696e645","schema_version":"1.0","event_id":"sha256:30f16d9c3232ad68388845ab6d4a905734d4fd6770387e2548ae19538696e645"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HG7AZDPHAXECTVX5AICJN4BELA/bundle.json","state_url":"https://pith.science/pith/HG7AZDPHAXECTVX5AICJN4BELA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HG7AZDPHAXECTVX5AICJN4BELA/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-06-24T03:19:23Z","links":{"resolver":"https://pith.science/pith/HG7AZDPHAXECTVX5AICJN4BELA","bundle":"https://pith.science/pith/HG7AZDPHAXECTVX5AICJN4BELA/bundle.json","state":"https://pith.science/pith/HG7AZDPHAXECTVX5AICJN4BELA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HG7AZDPHAXECTVX5AICJN4BELA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HG7AZDPHAXECTVX5AICJN4BELA","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":"61b877f165153b828a086c0045efbabdc56cbbda41d374f30decc88dab00466f","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-11-23T13:04:47Z","title_canon_sha256":"cca1ae338a21abbb12545aaefe5b7af04676767d47cf8e1da4c321219427d288"},"schema_version":"1.0","source":{"id":"1511.07209","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07209","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07209v2","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07209","created_at":"2026-05-18T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"HG7AZDPHAXEC","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HG7AZDPHAXECTVX5","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HG7AZDPH","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:30f16d9c3232ad68388845ab6d4a905734d4fd6770387e2548ae19538696e645","target":"graph","created_at":"2026-05-18T01:10:20Z","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"},"paper":{"abstract_excerpt":"We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a final destination. The goal is to maximize the rate of transportation while the objects are replenished over time. Examples of problems that need continuous transportation are foraging, area sweeping, and first/last mile problem. Previous approaches typically neglect the interference and are highly dependent on communications among agents. Some also incor","authors_text":"Chao Wang, Kian Hsiang Low, Somchaya Liemhetcharat","cross_cats":["cs.AI","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-11-23T13:04:47Z","title":"Multi-Agent Continuous Transportation with Online Balanced Partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07209","kind":"arxiv","version":2},"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:ea1d1d24520902ec59d705e1c9da5d240839e3bd9be97a5c994e68b52c7f7e6e","target":"record","created_at":"2026-05-18T01:10:20Z","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":"61b877f165153b828a086c0045efbabdc56cbbda41d374f30decc88dab00466f","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2015-11-23T13:04:47Z","title_canon_sha256":"cca1ae338a21abbb12545aaefe5b7af04676767d47cf8e1da4c321219427d288"},"schema_version":"1.0","source":{"id":"1511.07209","kind":"arxiv","version":2}},"canonical_sha256":"39be0c8de705c829d6fd020496f024581170a6d06a0cc96d2a6a839de25ed0ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39be0c8de705c829d6fd020496f024581170a6d06a0cc96d2a6a839de25ed0ed","first_computed_at":"2026-05-18T01:10:20.205452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:20.205452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYcCY3ZIuzGidMTeETI6zZL8WDCE0JHm4gFVdLi+59MEQDIAZ68uzhdIQXA/HdHkjyMtwFACJ4VLy2BxyWAvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:20.206045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07209","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea1d1d24520902ec59d705e1c9da5d240839e3bd9be97a5c994e68b52c7f7e6e","sha256:30f16d9c3232ad68388845ab6d4a905734d4fd6770387e2548ae19538696e645"],"state_sha256":"fc006cd48cba3eb2e7650efa9c31c99befa27d257306f2107b7f7aba13c596a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/+xTmF+tNmL5/xCWJw84DNfcvKCPSDrLWj8TV2LcEclPqFmVNqAUJOscSzawR0vQZ3PBz5Xc60tJ5PLgVEBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:19:23.238733Z","bundle_sha256":"c5f00b0c8672f57009c801af7739cabbb8c71b20779bb9668829c1cff0d61f67"}}