{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SMQUZKB7SSY2SRVHB74PWITIJM","short_pith_number":"pith:SMQUZKB7","canonical_record":{"source":{"id":"1908.00914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-02T15:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"80fec6864f50b560a536b282f6379ea0a78788fccb364e16007360b02ac5658d","abstract_canon_sha256":"bc0f913cb011bf90f70d0bee2917ae52b7a3c5f3abc77af4c3d9f6e201490245"},"schema_version":"1.0"},"canonical_sha256":"93214ca83f94b1a946a70ff8fb22684b17daedbca3c9a4df28f72e5ebeb11e7d","source":{"kind":"arxiv","id":"1908.00914","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00914","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00914v1","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00914","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"SMQUZKB7SSY2","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"SMQUZKB7SSY2SRVH","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"SMQUZKB7","created_at":"2026-07-05T00:09:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SMQUZKB7SSY2SRVHB74PWITIJM","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00914","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-02T15:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"80fec6864f50b560a536b282f6379ea0a78788fccb364e16007360b02ac5658d","abstract_canon_sha256":"bc0f913cb011bf90f70d0bee2917ae52b7a3c5f3abc77af4c3d9f6e201490245"},"schema_version":"1.0"},"canonical_sha256":"93214ca83f94b1a946a70ff8fb22684b17daedbca3c9a4df28f72e5ebeb11e7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:51.415670Z","signature_b64":"m+Kx5k+rWAmRIK6TUx5kcgGszhsZyTpBtJjYjjJMGZT9F8v1CR1NIvW30PAsz1XM3Z5XT/tzpWb3LAHnAml0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93214ca83f94b1a946a70ff8fb22684b17daedbca3c9a4df28f72e5ebeb11e7d","last_reissued_at":"2026-07-05T00:09:51.415196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:51.415196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00914","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-05T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbuc39IWWR6lPU7yJ0OrCv1VyEIaa1H26p5IC+xrZntKg2FTCQH0tjyP2rQtLlYhzTjFps2lDidOYo3nJ/TtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:52:22.437467Z"},"content_sha256":"f5c51fdd7d8d4e1b22b97ba2287c49a8c7162faa460df5647fed2d95d44e3d29","schema_version":"1.0","event_id":"sha256:f5c51fdd7d8d4e1b22b97ba2287c49a8c7162faa460df5647fed2d95d44e3d29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SMQUZKB7SSY2SRVHB74PWITIJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Network Formation in Unknown Unbounded Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Selim Engin, Volkan Isler","submitted_at":"2019-08-02T15:35:29Z","abstract_excerpt":"In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion.\n  For this problem, we present an algorithm whose competitive ratio is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00914","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/1908.00914/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-05T00:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utl3zL+pgF161IGy5XL4c/q5HYF8H95I5/vNwVI28fbU3e2c8nI094X4j2sZ8kdRS8Cq4IcrFw/QrDL7CEF3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:52:22.437840Z"},"content_sha256":"ce9da8cb8f0bdafd8bf6c4be081a22ab0979535bad0b22c5a075b25ee625111a","schema_version":"1.0","event_id":"sha256:ce9da8cb8f0bdafd8bf6c4be081a22ab0979535bad0b22c5a075b25ee625111a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMQUZKB7SSY2SRVHB74PWITIJM/bundle.json","state_url":"https://pith.science/pith/SMQUZKB7SSY2SRVHB74PWITIJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMQUZKB7SSY2SRVHB74PWITIJM/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-07-13T19:52:22Z","links":{"resolver":"https://pith.science/pith/SMQUZKB7SSY2SRVHB74PWITIJM","bundle":"https://pith.science/pith/SMQUZKB7SSY2SRVHB74PWITIJM/bundle.json","state":"https://pith.science/pith/SMQUZKB7SSY2SRVHB74PWITIJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMQUZKB7SSY2SRVHB74PWITIJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SMQUZKB7SSY2SRVHB74PWITIJM","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":"bc0f913cb011bf90f70d0bee2917ae52b7a3c5f3abc77af4c3d9f6e201490245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-02T15:35:29Z","title_canon_sha256":"80fec6864f50b560a536b282f6379ea0a78788fccb364e16007360b02ac5658d"},"schema_version":"1.0","source":{"id":"1908.00914","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00914","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00914v1","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00914","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"SMQUZKB7SSY2","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"SMQUZKB7SSY2SRVH","created_at":"2026-07-05T00:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"SMQUZKB7","created_at":"2026-07-05T00:09:51Z"}],"graph_snapshots":[{"event_id":"sha256:ce9da8cb8f0bdafd8bf6c4be081a22ab0979535bad0b22c5a075b25ee625111a","target":"graph","created_at":"2026-07-05T00:09:51Z","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/1908.00914/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the Online Network Formation Problem (ONFP) for a mobile multi-robot system. Consider a group of robots with a bounded communication range operating in a large open area. One of the robots has a piece of information which has to be propagated to all other robots. What strategy should the robots pursue to disseminate the information to the rest of the robots as quickly as possible? The initial locations of the robots are unknown to each other, therefore the problem must be solved in an online fashion.\n  For this problem, we present an algorithm whose competitive ratio is","authors_text":"Selim Engin, Volkan Isler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-02T15:35:29Z","title":"Asynchronous Network Formation in Unknown Unbounded Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00914","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:f5c51fdd7d8d4e1b22b97ba2287c49a8c7162faa460df5647fed2d95d44e3d29","target":"record","created_at":"2026-07-05T00:09:51Z","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":"bc0f913cb011bf90f70d0bee2917ae52b7a3c5f3abc77af4c3d9f6e201490245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-02T15:35:29Z","title_canon_sha256":"80fec6864f50b560a536b282f6379ea0a78788fccb364e16007360b02ac5658d"},"schema_version":"1.0","source":{"id":"1908.00914","kind":"arxiv","version":1}},"canonical_sha256":"93214ca83f94b1a946a70ff8fb22684b17daedbca3c9a4df28f72e5ebeb11e7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93214ca83f94b1a946a70ff8fb22684b17daedbca3c9a4df28f72e5ebeb11e7d","first_computed_at":"2026-07-05T00:09:51.415196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:09:51.415196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m+Kx5k+rWAmRIK6TUx5kcgGszhsZyTpBtJjYjjJMGZT9F8v1CR1NIvW30PAsz1XM3Z5XT/tzpWb3LAHnAml0AA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:09:51.415670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00914","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5c51fdd7d8d4e1b22b97ba2287c49a8c7162faa460df5647fed2d95d44e3d29","sha256:ce9da8cb8f0bdafd8bf6c4be081a22ab0979535bad0b22c5a075b25ee625111a"],"state_sha256":"f7d78bdf5978ef4d85e23aa1e305556b4f8766f99f269fe721ba2fdd64692b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FafPXeZP12MuWnTaDsG6RvsUHhqfjJSEqpgKVrgwv9Dx9cIJ63RxWph5Z/aKm1GZwAll08V5kvmP6CNBLBgmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T19:52:22.439969Z","bundle_sha256":"2cd219628ae61121f62ea674ed0e46e7165d78c9ed1a8d96d2ba7e21f6e35dda"}}