{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MEGJSPXNT6BZG7C4VWBB55PJZG","short_pith_number":"pith:MEGJSPXN","canonical_record":{"source":{"id":"1204.3850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-16T11:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"9e4ff25c981791e82370afeea2b445d0aa683290937b9704e32fcb4b3b210400","abstract_canon_sha256":"b9a9c6c3263552b51a3ea4eabc537012ee355782efa58afb5a6699b294df393f"},"schema_version":"1.0"},"canonical_sha256":"610c993eed9f83937c5cad821ef5e9c98f13f2ed16d36f296c0a8bb068fe6780","source":{"kind":"arxiv","id":"1204.3850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3850","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3850v1","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3850","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"MEGJSPXNT6BZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MEGJSPXNT6BZG7C4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MEGJSPXN","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MEGJSPXNT6BZG7C4VWBB55PJZG","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-16T11:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"9e4ff25c981791e82370afeea2b445d0aa683290937b9704e32fcb4b3b210400","abstract_canon_sha256":"b9a9c6c3263552b51a3ea4eabc537012ee355782efa58afb5a6699b294df393f"},"schema_version":"1.0"},"canonical_sha256":"610c993eed9f83937c5cad821ef5e9c98f13f2ed16d36f296c0a8bb068fe6780","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:55.028639Z","signature_b64":"Oql6RjBxYy0W/j2/iQENd4JMKYWAVs4DdHBlEyo/9dqUoes4GfaAvN/6YJmILYIrxZrLJAA8fySvsRaxvWvTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"610c993eed9f83937c5cad821ef5e9c98f13f2ed16d36f296c0a8bb068fe6780","last_reissued_at":"2026-05-17T23:58:55.028198Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:55.028198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3850","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-05-17T23:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2fhRTtaBykMQ9vMe6MqPR86dErlvON3jEiEjvioEBvgOh/WYIEtnCP9697F7ym7VS65glcFBtDaHMMXh5yvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:36:49.147705Z"},"content_sha256":"ccee37341abb4e960dc289da23262fe40f94242bd721674a3af512b34b0bad75","schema_version":"1.0","event_id":"sha256:ccee37341abb4e960dc289da23262fe40f94242bd721674a3af512b34b0bad75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MEGJSPXNT6BZG7C4VWBB55PJZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"J\\'er\\'emie Chalopin, Mat\\'u\\v{s} Mihal\\'ak, Peter Widmayer, Shantanu Das, Yann Disser","submitted_at":"2012-02-16T11:17:25Z","abstract_excerpt":"This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local observations at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows them to capture enough data in order to draw conclusions regarding the global layout of the polygon. In particular, we study the problem of reconstructing the visibility graph of a simple polygon by an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3850","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":""},"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-17T23:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yiZa+sJAcZ6GeoTsuEsnoFNuxXU9RHVvmefkk9/M/ed00hKI8G00tLqLA4qpehUzctZtDvsfTWEyU47RCUTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:36:49.148476Z"},"content_sha256":"7c9868149c0556b359739851570e7ff6112611de0f3576c5b0f3cd6e4c720c4a","schema_version":"1.0","event_id":"sha256:7c9868149c0556b359739851570e7ff6112611de0f3576c5b0f3cd6e4c720c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/bundle.json","state_url":"https://pith.science/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/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-05-31T02:36:49Z","links":{"resolver":"https://pith.science/pith/MEGJSPXNT6BZG7C4VWBB55PJZG","bundle":"https://pith.science/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/bundle.json","state":"https://pith.science/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEGJSPXNT6BZG7C4VWBB55PJZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MEGJSPXNT6BZG7C4VWBB55PJZG","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":"b9a9c6c3263552b51a3ea4eabc537012ee355782efa58afb5a6699b294df393f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-16T11:17:25Z","title_canon_sha256":"9e4ff25c981791e82370afeea2b445d0aa683290937b9704e32fcb4b3b210400"},"schema_version":"1.0","source":{"id":"1204.3850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3850","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3850v1","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3850","created_at":"2026-05-17T23:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"MEGJSPXNT6BZ","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MEGJSPXNT6BZG7C4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MEGJSPXN","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:7c9868149c0556b359739851570e7ff6112611de0f3576c5b0f3cd6e4c720c4a","target":"graph","created_at":"2026-05-17T23:58:55Z","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":"This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight lines inside a polygon, using their sensors to gather local observations at each vertex. Our attention revolves around the question whether a given configuration of sensors and movement capabilities of the agents allows them to capture enough data in order to draw conclusions regarding the global layout of the polygon. In particular, we study the problem of reconstructing the visibility graph of a simple polygon by an ","authors_text":"J\\'er\\'emie Chalopin, Mat\\'u\\v{s} Mihal\\'ak, Peter Widmayer, Shantanu Das, Yann Disser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-16T11:17:25Z","title":"Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3850","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:ccee37341abb4e960dc289da23262fe40f94242bd721674a3af512b34b0bad75","target":"record","created_at":"2026-05-17T23:58:55Z","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":"b9a9c6c3263552b51a3ea4eabc537012ee355782efa58afb5a6699b294df393f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-16T11:17:25Z","title_canon_sha256":"9e4ff25c981791e82370afeea2b445d0aa683290937b9704e32fcb4b3b210400"},"schema_version":"1.0","source":{"id":"1204.3850","kind":"arxiv","version":1}},"canonical_sha256":"610c993eed9f83937c5cad821ef5e9c98f13f2ed16d36f296c0a8bb068fe6780","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"610c993eed9f83937c5cad821ef5e9c98f13f2ed16d36f296c0a8bb068fe6780","first_computed_at":"2026-05-17T23:58:55.028198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:55.028198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oql6RjBxYy0W/j2/iQENd4JMKYWAVs4DdHBlEyo/9dqUoes4GfaAvN/6YJmILYIrxZrLJAA8fySvsRaxvWvTAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:55.028639Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccee37341abb4e960dc289da23262fe40f94242bd721674a3af512b34b0bad75","sha256:7c9868149c0556b359739851570e7ff6112611de0f3576c5b0f3cd6e4c720c4a"],"state_sha256":"f21d38a2f4c316e8d603efc60ca99b22c68799c38f63933201996cf3912f4fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqG5aeFWqc+8AO/1Zwu8nikg9YroeZ+FHL0AtNZDp0VEez7lMqrFuYsgfVPJz8Gu9AicmAv9YUE9NJhYyDXkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:36:49.152491Z","bundle_sha256":"f185ad39b58a5f9dce88a1ecd155bbd192a705c93ebc0f62765f0fbf1fe352c5"}}