{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GBLRBQ2LCSBDOJQ2XXKYVJ44U4","short_pith_number":"pith:GBLRBQ2L","canonical_record":{"source":{"id":"1702.01452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-05T21:09:25Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e6385951ed74458446f537c21cd0d90192f24b6109b7f4c73967a7b4a562b5f6","abstract_canon_sha256":"7aadced64d6ed9b34be710c64a5d146ed731e74ef0b647c1bc7c78f10b16d4dc"},"schema_version":"1.0"},"canonical_sha256":"305710c34b148237261abdd58aa79ca711113e230213b7e77bb87eec5988aac7","source":{"kind":"arxiv","id":"1702.01452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01452","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01452v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01452","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"GBLRBQ2LCSBD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBLRBQ2LCSBDOJQ2","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBLRBQ2L","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GBLRBQ2LCSBDOJQ2XXKYVJ44U4","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-05T21:09:25Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e6385951ed74458446f537c21cd0d90192f24b6109b7f4c73967a7b4a562b5f6","abstract_canon_sha256":"7aadced64d6ed9b34be710c64a5d146ed731e74ef0b647c1bc7c78f10b16d4dc"},"schema_version":"1.0"},"canonical_sha256":"305710c34b148237261abdd58aa79ca711113e230213b7e77bb87eec5988aac7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:23.352503Z","signature_b64":"27HA2A00BEhMgpBVovoryMsmgRPcElQhgw8J6qgL2p81xP4CoyW4Pe4zyubnSHIPHy/htqGT+nMJttk+yObOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"305710c34b148237261abdd58aa79ca711113e230213b7e77bb87eec5988aac7","last_reissued_at":"2026-05-18T00:51:23.351819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:23.351819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01452","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-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hVwAx+xQ+n75uX6s8nhwCAb83+//uhZ/l/Y/S6Yhref29uKPuulA9bEsIkWqlFIM6UofZOdz00eD6TADKOyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:15:50.953878Z"},"content_sha256":"27b164c3dcdd46a53abe50c24f259465f291dd941ad98ae5f6833588748c2dc3","schema_version":"1.0","event_id":"sha256:27b164c3dcdd46a53abe50c24f259465f291dd941ad98ae5f6833588748c2dc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GBLRBQ2LCSBDOJQ2XXKYVJ44U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Optimal Strategy for Adaptive Probing in Incomplete Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Hung T. Nguyen, Thang N. Dinh, Tri P. Nguyen","submitted_at":"2017-02-05T21:09:25Z","abstract_excerpt":"We investigate a graph probing problem in which an agent has only an incomplete view $G' \\subsetneq G$ of the network and wishes to explore the network with least effort. In each step, the agent selects a node $u$ in $G'$ to probe. After probing $u$, the agent gains the information about $u$ and its neighbors. All the neighbors of $u$ become \\emph{observed} and are \\emph{probable} in the subsequent steps (if they have not been probed). What is the best probing strategy to maximize the number of nodes explored in $k$ probes? This problem serves as a fundamental component for other decision-maki"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01452","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-18T00:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t/1x5+ZzGbwJxS5u5B2EBAkjtsWV/90VTAQhoSXN+COD3KA8K7o0VJlurp0PbIJydgpaGq5CRrQ+LYpvBIq6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:15:50.954224Z"},"content_sha256":"e1869f2b0ed1c388695075809f66c6d0bfa3737120fc18f4d2d667d9e2b2b36c","schema_version":"1.0","event_id":"sha256:e1869f2b0ed1c388695075809f66c6d0bfa3737120fc18f4d2d667d9e2b2b36c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/bundle.json","state_url":"https://pith.science/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/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-23T08:15:50Z","links":{"resolver":"https://pith.science/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4","bundle":"https://pith.science/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/bundle.json","state":"https://pith.science/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBLRBQ2LCSBDOJQ2XXKYVJ44U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GBLRBQ2LCSBDOJQ2XXKYVJ44U4","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":"7aadced64d6ed9b34be710c64a5d146ed731e74ef0b647c1bc7c78f10b16d4dc","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-05T21:09:25Z","title_canon_sha256":"e6385951ed74458446f537c21cd0d90192f24b6109b7f4c73967a7b4a562b5f6"},"schema_version":"1.0","source":{"id":"1702.01452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01452","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01452v1","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01452","created_at":"2026-05-18T00:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"GBLRBQ2LCSBD","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GBLRBQ2LCSBDOJQ2","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GBLRBQ2L","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:e1869f2b0ed1c388695075809f66c6d0bfa3737120fc18f4d2d667d9e2b2b36c","target":"graph","created_at":"2026-05-18T00:51:23Z","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 investigate a graph probing problem in which an agent has only an incomplete view $G' \\subsetneq G$ of the network and wishes to explore the network with least effort. In each step, the agent selects a node $u$ in $G'$ to probe. After probing $u$, the agent gains the information about $u$ and its neighbors. All the neighbors of $u$ become \\emph{observed} and are \\emph{probable} in the subsequent steps (if they have not been probed). What is the best probing strategy to maximize the number of nodes explored in $k$ probes? This problem serves as a fundamental component for other decision-maki","authors_text":"Hung T. Nguyen, Thang N. Dinh, Tri P. Nguyen","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-05T21:09:25Z","title":"Towards Optimal Strategy for Adaptive Probing in Incomplete Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01452","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:27b164c3dcdd46a53abe50c24f259465f291dd941ad98ae5f6833588748c2dc3","target":"record","created_at":"2026-05-18T00:51:23Z","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":"7aadced64d6ed9b34be710c64a5d146ed731e74ef0b647c1bc7c78f10b16d4dc","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-05T21:09:25Z","title_canon_sha256":"e6385951ed74458446f537c21cd0d90192f24b6109b7f4c73967a7b4a562b5f6"},"schema_version":"1.0","source":{"id":"1702.01452","kind":"arxiv","version":1}},"canonical_sha256":"305710c34b148237261abdd58aa79ca711113e230213b7e77bb87eec5988aac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"305710c34b148237261abdd58aa79ca711113e230213b7e77bb87eec5988aac7","first_computed_at":"2026-05-18T00:51:23.351819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:23.351819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"27HA2A00BEhMgpBVovoryMsmgRPcElQhgw8J6qgL2p81xP4CoyW4Pe4zyubnSHIPHy/htqGT+nMJttk+yObOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:23.352503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b164c3dcdd46a53abe50c24f259465f291dd941ad98ae5f6833588748c2dc3","sha256:e1869f2b0ed1c388695075809f66c6d0bfa3737120fc18f4d2d667d9e2b2b36c"],"state_sha256":"3dd38abc66db90214aaae18d37a16ed311ac89358419fb7b5772128ea046a0be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZkxmxSSUf6Gz1yaVTP+2dGzL+6GJFS/xrvps0JFLXtJCfrMq6FIG9iA1vw0b7xJuPr7u/RQ9pTnqrGnfy6WCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:15:50.956218Z","bundle_sha256":"d6e9a314877e88087cb0397852091192c94a37edfba8a75c0b7e0b83ee03c296"}}