{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MM7AGF7NUDNYMS5GESF6VZMMUD","short_pith_number":"pith:MM7AGF7N","canonical_record":{"source":{"id":"1809.06025","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-17T05:24:14Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"b670ea2eafaa6274026ad085b2063ceca76f60c9c35b2fbe3cf291b2d213ddbf","abstract_canon_sha256":"d671e3630a029710ac1113ada747555663144d28f4d62f0a339be1c85f2a83df"},"schema_version":"1.0"},"canonical_sha256":"633e0317eda0db864ba6248beae58ca0c3a2451966abd7a3ef691e3cd2dbc632","source":{"kind":"arxiv","id":"1809.06025","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06025","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06025v6","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06025","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"MM7AGF7NUDNY","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"MM7AGF7NUDNYMS5G","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"MM7AGF7N","created_at":"2026-07-05T04:08:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MM7AGF7NUDNYMS5GESF6VZMMUD","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06025","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-17T05:24:14Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"b670ea2eafaa6274026ad085b2063ceca76f60c9c35b2fbe3cf291b2d213ddbf","abstract_canon_sha256":"d671e3630a029710ac1113ada747555663144d28f4d62f0a339be1c85f2a83df"},"schema_version":"1.0"},"canonical_sha256":"633e0317eda0db864ba6248beae58ca0c3a2451966abd7a3ef691e3cd2dbc632","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:36.906062Z","signature_b64":"pkqSkNGRkgexrGjUGqxokgzmkSALxzffS0PMW/jVNF9nQq8ROiqg25dACYpk8svreVhscvLCoSAiBxiQi28HBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"633e0317eda0db864ba6248beae58ca0c3a2451966abd7a3ef691e3cd2dbc632","last_reissued_at":"2026-07-05T04:08:36.905607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:36.905607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06025","source_version":6,"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-05T04:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2m4A1vqIIrHJyjKg/IDEqoiT5sv4pqnKtrlh86QljOyXXIJOrbQqfKNNoVDvQXWUo4ZCJ7PcR7KHseJ7F79Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:57:27.405372Z"},"content_sha256":"f2e9f9e6915ede99d2e5361f6c2d75bd170a19224de08e956522702ca2772efa","schema_version":"1.0","event_id":"sha256:f2e9f9e6915ede99d2e5361f6c2d75bd170a19224de08e956522702ca2772efa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MM7AGF7NUDNYMS5GESF6VZMMUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Algorithms for Sparse Sensor Placement via Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Louis Ly, Yen-Hsi Richard Tsai","submitted_at":"2018-09-17T05:24:14Z","abstract_excerpt":"We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy algorithm. We provide a bound on the optimality of the greedy algorithm using submodularity theory. Using a level set representation, we train a convolutional neural network to determine vantage points that maximize visibility. We show that this method drastically reduces the on-line computational cost and determines a small set of vantage points that solve the probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06025","kind":"arxiv","version":6},"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/1809.06025/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-05T04:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QdhPSq3/FjCH6JTfgeklGHgHRLvLetm/AJ9jgejCKFdYX3i3Fq58cQbwZpWhrcFbGlkUX6JhSyqMmtK3ZcXNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:57:27.406265Z"},"content_sha256":"96567fb2a9b5205d4bb1ceb9cec87b9a68140b12649e4933f8cc772d2abd0fe6","schema_version":"1.0","event_id":"sha256:96567fb2a9b5205d4bb1ceb9cec87b9a68140b12649e4933f8cc772d2abd0fe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/bundle.json","state_url":"https://pith.science/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/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-08-16T10:57:27Z","links":{"resolver":"https://pith.science/pith/MM7AGF7NUDNYMS5GESF6VZMMUD","bundle":"https://pith.science/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/bundle.json","state":"https://pith.science/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MM7AGF7NUDNYMS5GESF6VZMMUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MM7AGF7NUDNYMS5GESF6VZMMUD","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":"d671e3630a029710ac1113ada747555663144d28f4d62f0a339be1c85f2a83df","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-17T05:24:14Z","title_canon_sha256":"b670ea2eafaa6274026ad085b2063ceca76f60c9c35b2fbe3cf291b2d213ddbf"},"schema_version":"1.0","source":{"id":"1809.06025","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06025","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06025v6","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06025","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"MM7AGF7NUDNY","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"MM7AGF7NUDNYMS5G","created_at":"2026-07-05T04:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"MM7AGF7N","created_at":"2026-07-05T04:08:36Z"}],"graph_snapshots":[{"event_id":"sha256:96567fb2a9b5205d4bb1ceb9cec87b9a68140b12649e4933f8cc772d2abd0fe6","target":"graph","created_at":"2026-07-05T04:08:36Z","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/1809.06025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the exploration problem: an agent equipped with a depth sensor must map out a previously unknown environment using as few sensor measurements as possible. We propose an approach based on supervised learning of a greedy algorithm. We provide a bound on the optimality of the greedy algorithm using submodularity theory. Using a level set representation, we train a convolutional neural network to determine vantage points that maximize visibility. We show that this method drastically reduces the on-line computational cost and determines a small set of vantage points that solve the probl","authors_text":"Louis Ly, Yen-Hsi Richard Tsai","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-17T05:24:14Z","title":"Greedy Algorithms for Sparse Sensor Placement via Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06025","kind":"arxiv","version":6},"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:f2e9f9e6915ede99d2e5361f6c2d75bd170a19224de08e956522702ca2772efa","target":"record","created_at":"2026-07-05T04:08:36Z","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":"d671e3630a029710ac1113ada747555663144d28f4d62f0a339be1c85f2a83df","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-17T05:24:14Z","title_canon_sha256":"b670ea2eafaa6274026ad085b2063ceca76f60c9c35b2fbe3cf291b2d213ddbf"},"schema_version":"1.0","source":{"id":"1809.06025","kind":"arxiv","version":6}},"canonical_sha256":"633e0317eda0db864ba6248beae58ca0c3a2451966abd7a3ef691e3cd2dbc632","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"633e0317eda0db864ba6248beae58ca0c3a2451966abd7a3ef691e3cd2dbc632","first_computed_at":"2026-07-05T04:08:36.905607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:08:36.905607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkqSkNGRkgexrGjUGqxokgzmkSALxzffS0PMW/jVNF9nQq8ROiqg25dACYpk8svreVhscvLCoSAiBxiQi28HBg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:08:36.906062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06025","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2e9f9e6915ede99d2e5361f6c2d75bd170a19224de08e956522702ca2772efa","sha256:96567fb2a9b5205d4bb1ceb9cec87b9a68140b12649e4933f8cc772d2abd0fe6"],"state_sha256":"c181bdc1ad45111053df8a44a4b1f71ec2d8da0f304696e4589d4860b4b60766"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJQz/VQrbyzBF4VYoiOd3rA7PPtCM5+vN5xNlrL+QbDwzIdz0IC5y833XCohsSJMpLjTjfNpVeMfLmlK5SZ5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:57:27.412983Z","bundle_sha256":"2a4e96a6269690f3431bc346dbb1139a370399d9bdc203eae4b147ac2bdf2fdd"}}