{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5TYQSG2LY4SB7TCZL6A4H5T6NS","short_pith_number":"pith:5TYQSG2L","canonical_record":{"source":{"id":"1803.07705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T00:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"45a9c428e1c59cfc3dc6b4bf17b4195d76fa4f574097df9f92736b908f15e219","abstract_canon_sha256":"95e06cf68b13a1a8ba3b513570c15b1b0d35b3337026ec34667896c832d0d8ba"},"schema_version":"1.0"},"canonical_sha256":"ecf1091b4bc7241fcc595f81c3f67e6ca2b29cb55fc839dc0ccaeb992446afcd","source":{"kind":"arxiv","id":"1803.07705","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07705","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07705v2","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07705","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"5TYQSG2LY4SB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5TYQSG2LY4SB7TCZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5TYQSG2L","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5TYQSG2LY4SB7TCZL6A4H5T6NS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T00:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"45a9c428e1c59cfc3dc6b4bf17b4195d76fa4f574097df9f92736b908f15e219","abstract_canon_sha256":"95e06cf68b13a1a8ba3b513570c15b1b0d35b3337026ec34667896c832d0d8ba"},"schema_version":"1.0"},"canonical_sha256":"ecf1091b4bc7241fcc595f81c3f67e6ca2b29cb55fc839dc0ccaeb992446afcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:53.598887Z","signature_b64":"hLSQeSpRrpJfV/OiZ3XRR2DFT3VgMidtDG9dJ4hdeJA8wkJ0J94q8HYs7kHYFC+UBFDuPETT/Qsh++WzngZhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf1091b4bc7241fcc595f81c3f67e6ca2b29cb55fc839dc0ccaeb992446afcd","last_reissued_at":"2026-05-18T00:14:53.598301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:53.598301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07705","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-18T00:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4+Jsu+kjgxMXl0+gL8byaat3jtadMNfP5mgoXrB6jUXADfOGT+Nk0XVzm771m3LuHcDPNGcpF79qH7o6TkNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:20:41.280028Z"},"content_sha256":"7be3b884c60c0eabb33c3e6f34bd5724d4fc2cfc9f62962e26448564e558f693","schema_version":"1.0","event_id":"sha256:7be3b884c60c0eabb33c3e6f34bd5724d4fc2cfc9f62962e26448564e558f693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5TYQSG2LY4SB7TCZL6A4H5T6NS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chains with Maximum Return Time Entropy for Robotic Surveillance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Bullo, Mishel George, Xiaoming Duan","submitted_at":"2018-03-21T00:47:22Z","abstract_excerpt":"Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy is the weighted average, over all graph nodes, of the entropy of the first return times of the Markov chain; this objective function is a function series that does not admit in general a closed form.\n  The paper features theoretical and computational contributions. First, we obtain a discrete-time delayed linear system for the return time probability distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07705","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-18T00:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VIBdzv5qZ22TrhJ/qj6rKpQiw4bRewS4zIw3bwBOYHkVC3j/dFZABsFvRphhNdW+nqv2dYn/xbqSH22wwpOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:20:41.280395Z"},"content_sha256":"16965d548b0dc0e31a26a88fddedfa086a91381970c29d7dcabda34964eb8915","schema_version":"1.0","event_id":"sha256:16965d548b0dc0e31a26a88fddedfa086a91381970c29d7dcabda34964eb8915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/bundle.json","state_url":"https://pith.science/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/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-07T02:20:41Z","links":{"resolver":"https://pith.science/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS","bundle":"https://pith.science/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/bundle.json","state":"https://pith.science/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TYQSG2LY4SB7TCZL6A4H5T6NS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5TYQSG2LY4SB7TCZL6A4H5T6NS","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":"95e06cf68b13a1a8ba3b513570c15b1b0d35b3337026ec34667896c832d0d8ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T00:47:22Z","title_canon_sha256":"45a9c428e1c59cfc3dc6b4bf17b4195d76fa4f574097df9f92736b908f15e219"},"schema_version":"1.0","source":{"id":"1803.07705","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07705","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07705v2","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07705","created_at":"2026-05-18T00:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"5TYQSG2LY4SB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5TYQSG2LY4SB7TCZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5TYQSG2L","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:16965d548b0dc0e31a26a88fddedfa086a91381970c29d7dcabda34964eb8915","target":"graph","created_at":"2026-05-18T00:14:53Z","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":"Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy is the weighted average, over all graph nodes, of the entropy of the first return times of the Markov chain; this objective function is a function series that does not admit in general a closed form.\n  The paper features theoretical and computational contributions. First, we obtain a discrete-time delayed linear system for the return time probability distri","authors_text":"Francesco Bullo, Mishel George, Xiaoming Duan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T00:47:22Z","title":"Markov Chains with Maximum Return Time Entropy for Robotic Surveillance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07705","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:7be3b884c60c0eabb33c3e6f34bd5724d4fc2cfc9f62962e26448564e558f693","target":"record","created_at":"2026-05-18T00:14:53Z","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":"95e06cf68b13a1a8ba3b513570c15b1b0d35b3337026ec34667896c832d0d8ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-21T00:47:22Z","title_canon_sha256":"45a9c428e1c59cfc3dc6b4bf17b4195d76fa4f574097df9f92736b908f15e219"},"schema_version":"1.0","source":{"id":"1803.07705","kind":"arxiv","version":2}},"canonical_sha256":"ecf1091b4bc7241fcc595f81c3f67e6ca2b29cb55fc839dc0ccaeb992446afcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecf1091b4bc7241fcc595f81c3f67e6ca2b29cb55fc839dc0ccaeb992446afcd","first_computed_at":"2026-05-18T00:14:53.598301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:53.598301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLSQeSpRrpJfV/OiZ3XRR2DFT3VgMidtDG9dJ4hdeJA8wkJ0J94q8HYs7kHYFC+UBFDuPETT/Qsh++WzngZhBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:53.598887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07705","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7be3b884c60c0eabb33c3e6f34bd5724d4fc2cfc9f62962e26448564e558f693","sha256:16965d548b0dc0e31a26a88fddedfa086a91381970c29d7dcabda34964eb8915"],"state_sha256":"e9a20d7252ba67e74a23f582fe558b051b07397e9d8d667dd2d7c53615ac5f06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mbMrbrSi8akd21cqYcuvSPn5GtMYfvTRj8EQIZgtGVpkq1NaQYjL2UeoAECr4E4gzUWCc/uTC+23FNCRQLLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:20:41.282532Z","bundle_sha256":"bc36d96d0e8b443b1c7bc55f59fe2d6cec7d2f9146d233ac241ec06aa1dcadcc"}}