{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:36JXAGO4ZKKIZEUZWTBQBBQZZW","short_pith_number":"pith:36JXAGO4","canonical_record":{"source":{"id":"1806.09806","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T06:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"852ad36f2be4c7b61c2718815c3f1f40590ac1cfc6399eb4aee0fe6556a22dbc","abstract_canon_sha256":"0c28611d7b017fe307d1ff39ff02f7f3bf9247b52e9bf2ef06d4282e206df76d"},"schema_version":"1.0"},"canonical_sha256":"df937019dcca948c9299b4c3008619cd8ad5b6388a73b9980015230f456c20a5","source":{"kind":"arxiv","id":"1806.09806","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09806","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09806v3","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09806","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"36JXAGO4ZKKI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36JXAGO4ZKKIZEUZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36JXAGO4","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:36JXAGO4ZKKIZEUZWTBQBBQZZW","target":"record","payload":{"canonical_record":{"source":{"id":"1806.09806","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T06:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"852ad36f2be4c7b61c2718815c3f1f40590ac1cfc6399eb4aee0fe6556a22dbc","abstract_canon_sha256":"0c28611d7b017fe307d1ff39ff02f7f3bf9247b52e9bf2ef06d4282e206df76d"},"schema_version":"1.0"},"canonical_sha256":"df937019dcca948c9299b4c3008619cd8ad5b6388a73b9980015230f456c20a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:06.527072Z","signature_b64":"+zlWQ3Tth6Ud4aM7Ex5PLPLg/JPLR9k0MbCY6ftOS0PZbLn1Z+InC6lzaNQkF3KZHtbBTO9HWFIoyMFiL3lyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df937019dcca948c9299b4c3008619cd8ad5b6388a73b9980015230f456c20a5","last_reissued_at":"2026-05-17T23:53:06.526260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:06.526260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.09806","source_version":3,"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:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EL13AHznL0REtvwuzNaYotFeTcaPm9tJggqMw2xVd2EBfh1btHA+P0ZN0P93PMHki/vl9SdGB+AxQmsQ71kgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:31:40.144374Z"},"content_sha256":"b52be5890214f2f6553c1860108c355f8cb312d98de5dd5d3f40695386c14b92","schema_version":"1.0","event_id":"sha256:b52be5890214f2f6553c1860108c355f8cb312d98de5dd5d3f40695386c14b92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:36JXAGO4ZKKIZEUZWTBQBBQZZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Time Online Algorithm Inferring the Shortest Path from a Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Shintaro Narisada","submitted_at":"2018-06-26T06:15:32Z","abstract_excerpt":"We consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph. It has been known that this problem is solvable in $O(n \\log n)$ time when the targets are path or cycle graphs. This paper presents an online algorithm for the problem of this restricted case that runs in $O(n)$ time, based on Manacher's algorithm for computing all the maximal palindromes in a string."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09806","kind":"arxiv","version":3},"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:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JE7Ixt5NmLwKkROHnmqGLiiwkAstsXwQ5vbk4Yz5XO8fr/fCclc6vrPVkB3TijOshcJwrxLhstSiD03pXT1jDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:31:40.144759Z"},"content_sha256":"5d8205bdcce420bc06c4c87fada06b7c21b314d0c5c00de11a4e91dd439ff712","schema_version":"1.0","event_id":"sha256:5d8205bdcce420bc06c4c87fada06b7c21b314d0c5c00de11a4e91dd439ff712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/bundle.json","state_url":"https://pith.science/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/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-28T05:31:40Z","links":{"resolver":"https://pith.science/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW","bundle":"https://pith.science/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/bundle.json","state":"https://pith.science/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36JXAGO4ZKKIZEUZWTBQBBQZZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:36JXAGO4ZKKIZEUZWTBQBBQZZW","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":"0c28611d7b017fe307d1ff39ff02f7f3bf9247b52e9bf2ef06d4282e206df76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T06:15:32Z","title_canon_sha256":"852ad36f2be4c7b61c2718815c3f1f40590ac1cfc6399eb4aee0fe6556a22dbc"},"schema_version":"1.0","source":{"id":"1806.09806","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.09806","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1806.09806v3","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09806","created_at":"2026-05-17T23:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"36JXAGO4ZKKI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36JXAGO4ZKKIZEUZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36JXAGO4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:5d8205bdcce420bc06c4c87fada06b7c21b314d0c5c00de11a4e91dd439ff712","target":"graph","created_at":"2026-05-17T23:53:06Z","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 consider the problem of inferring an edge-labeled graph from the sequence of edge labels seen in a walk of that graph. It has been known that this problem is solvable in $O(n \\log n)$ time when the targets are path or cycle graphs. This paper presents an online algorithm for the problem of this restricted case that runs in $O(n)$ time, based on Manacher's algorithm for computing all the maximal palindromes in a string.","authors_text":"Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Shintaro Narisada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T06:15:32Z","title":"Linear-Time Online Algorithm Inferring the Shortest Path from a Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09806","kind":"arxiv","version":3},"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:b52be5890214f2f6553c1860108c355f8cb312d98de5dd5d3f40695386c14b92","target":"record","created_at":"2026-05-17T23:53:06Z","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":"0c28611d7b017fe307d1ff39ff02f7f3bf9247b52e9bf2ef06d4282e206df76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-26T06:15:32Z","title_canon_sha256":"852ad36f2be4c7b61c2718815c3f1f40590ac1cfc6399eb4aee0fe6556a22dbc"},"schema_version":"1.0","source":{"id":"1806.09806","kind":"arxiv","version":3}},"canonical_sha256":"df937019dcca948c9299b4c3008619cd8ad5b6388a73b9980015230f456c20a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df937019dcca948c9299b4c3008619cd8ad5b6388a73b9980015230f456c20a5","first_computed_at":"2026-05-17T23:53:06.526260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:06.526260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zlWQ3Tth6Ud4aM7Ex5PLPLg/JPLR9k0MbCY6ftOS0PZbLn1Z+InC6lzaNQkF3KZHtbBTO9HWFIoyMFiL3lyAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:06.527072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.09806","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b52be5890214f2f6553c1860108c355f8cb312d98de5dd5d3f40695386c14b92","sha256:5d8205bdcce420bc06c4c87fada06b7c21b314d0c5c00de11a4e91dd439ff712"],"state_sha256":"ec880cf5d925ce7a50ce193a2a70dcad3e9703a44ff6c110ab4b45670e1a1c65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Do3rPk7k1uZMRXol/2PLQfHK38TCTT8gnWdQ/gg9E9beP2qKyY3cJglFXrB0NWJLWMApkn0a/KxjagX6yK4UBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:31:40.147102Z","bundle_sha256":"8e6effbefc958c2072426bf5f3b50bb651d8cc72a6404d2a42829952136e1a05"}}