{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EZLF4OLGMDKNMF3QJ4JQ3BYAGH","short_pith_number":"pith:EZLF4OLG","canonical_record":{"source":{"id":"1905.01788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T02:05:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"35722d40cd252492ef4774867e45d1ba17e85f0316b5ed916a03f7fe5d3836db","abstract_canon_sha256":"785f195ca8106bbec11a948fe2393b178066896925b52e9e379b58a0495d06b5"},"schema_version":"1.0"},"canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","source":{"kind":"arxiv","id":"1905.01788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01788","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01788v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01788","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"EZLF4OLGMDKN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZLF4OLGMDKNMF3Q","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZLF4OLG","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EZLF4OLGMDKNMF3QJ4JQ3BYAGH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T02:05:07Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"35722d40cd252492ef4774867e45d1ba17e85f0316b5ed916a03f7fe5d3836db","abstract_canon_sha256":"785f195ca8106bbec11a948fe2393b178066896925b52e9e379b58a0495d06b5"},"schema_version":"1.0"},"canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:57.413304Z","signature_b64":"brjTbpcC/FbUuvHW3DpKB2USPeVfKlsqT5g99Upg0AcMeJh2h5azrt1tzzVIlDGikgtkvr48AYKDDMjbBK9WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","last_reissued_at":"2026-05-17T23:46:57.412612Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:57.412612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01788","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmCh8FHQCZHoPAPcjTayi3JZaoDYQH/MQBwQGPHIbpL3IDq6QjS77Jl9kus1q6oMU+XgVPvKlXuE3S407gOZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:06:30.364849Z"},"content_sha256":"46775a9fb3f6a576cc86886a414365b92dba6b9fc171a43dd3ca8c7dbf7fabc5","schema_version":"1.0","event_id":"sha256:46775a9fb3f6a576cc86886a414365b92dba6b9fc171a43dd3ca8c7dbf7fabc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EZLF4OLGMDKNMF3QJ4JQ3BYAGH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistically Discriminative Sub-trajectory Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hiroki Toda, Ichiro Takeuchi, Kazuya Nishi, Masayuki Karasuyama, Masayuki Sunaga, Taiju Ishiyama, Takuto Sakuma, Vo Nguyen Le Duy, Yasuo Tabei, Yuta Okubo","submitted_at":"2019-05-06T02:05:07Z","abstract_excerpt":"We study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less similar to those of the other. We propose a new method called Statistically Discriminative Sub-trajectory Mining (SDSM) for this problem. An advantage of the SDSM method is that the statistical significance of the extracted sub-trajectories are properly controlled in the sense that the probability of finding a false positive sub-trajectory is smaller"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01788","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:46:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5inz2ewoYByB6ohlOHoSbF4YzhDZTWVAToO42IN2TEZiEGI/IrBdd2ULmji0WM3gIGWVHNPeDf4ymiRPS2TMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:06:30.365199Z"},"content_sha256":"b1387a160bde940e68dc43c1ed18d67d91622e5689aadebdf928bdd8f3b83ad8","schema_version":"1.0","event_id":"sha256:b1387a160bde940e68dc43c1ed18d67d91622e5689aadebdf928bdd8f3b83ad8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/bundle.json","state_url":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/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-28T09:06:30Z","links":{"resolver":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH","bundle":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/bundle.json","state":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EZLF4OLGMDKNMF3QJ4JQ3BYAGH","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":"785f195ca8106bbec11a948fe2393b178066896925b52e9e379b58a0495d06b5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T02:05:07Z","title_canon_sha256":"35722d40cd252492ef4774867e45d1ba17e85f0316b5ed916a03f7fe5d3836db"},"schema_version":"1.0","source":{"id":"1905.01788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01788","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01788v1","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01788","created_at":"2026-05-17T23:46:57Z"},{"alias_kind":"pith_short_12","alias_value":"EZLF4OLGMDKN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EZLF4OLGMDKNMF3Q","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EZLF4OLG","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:b1387a160bde940e68dc43c1ed18d67d91622e5689aadebdf928bdd8f3b83ad8","target":"graph","created_at":"2026-05-17T23:46:57Z","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 study the problem of discriminative sub-trajectory mining. Given two groups of trajectories, the goal of this problem is to extract moving patterns in the form of sub-trajectories which are more similar to sub-trajectories of one group and less similar to those of the other. We propose a new method called Statistically Discriminative Sub-trajectory Mining (SDSM) for this problem. An advantage of the SDSM method is that the statistical significance of the extracted sub-trajectories are properly controlled in the sense that the probability of finding a false positive sub-trajectory is smaller","authors_text":"Hiroki Toda, Ichiro Takeuchi, Kazuya Nishi, Masayuki Karasuyama, Masayuki Sunaga, Taiju Ishiyama, Takuto Sakuma, Vo Nguyen Le Duy, Yasuo Tabei, Yuta Okubo","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T02:05:07Z","title":"Statistically Discriminative Sub-trajectory Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01788","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:46775a9fb3f6a576cc86886a414365b92dba6b9fc171a43dd3ca8c7dbf7fabc5","target":"record","created_at":"2026-05-17T23:46:57Z","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":"785f195ca8106bbec11a948fe2393b178066896925b52e9e379b58a0495d06b5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-06T02:05:07Z","title_canon_sha256":"35722d40cd252492ef4774867e45d1ba17e85f0316b5ed916a03f7fe5d3836db"},"schema_version":"1.0","source":{"id":"1905.01788","kind":"arxiv","version":1}},"canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","first_computed_at":"2026-05-17T23:46:57.412612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:57.412612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brjTbpcC/FbUuvHW3DpKB2USPeVfKlsqT5g99Upg0AcMeJh2h5azrt1tzzVIlDGikgtkvr48AYKDDMjbBK9WDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:57.413304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46775a9fb3f6a576cc86886a414365b92dba6b9fc171a43dd3ca8c7dbf7fabc5","sha256:b1387a160bde940e68dc43c1ed18d67d91622e5689aadebdf928bdd8f3b83ad8"],"state_sha256":"481b5f92b9b88ac6ded633cf82d908bac39762cffd1439790c3bc9bea8e45c18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ox0CqmSyNF1QCG4gNxMWS0ZMMCJLAAhookJgxLAZb1tsOZzbv2F8080HQVCwBzh4Bxzp63pi/lonFXWZWjI1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:06:30.367227Z","bundle_sha256":"257b3a991bcaccad84c81d7b6de688a992cff67141f1f44263b8e6fa3cba1e0a"}}