{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EZLF4OLGMDKNMF3QJ4JQ3BYAGH","short_pith_number":"pith:EZLF4OLG","schema_version":"1.0","canonical_sha256":"26565e396660d4d617704f130d870031d39f8af4a3328bffe3894abfc1fa451d","source":{"kind":"arxiv","id":"1905.01788","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.01788","created_at":"2026-05-17T23:46:57.412719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01788v1","created_at":"2026-05-17T23:46:57.412719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01788","created_at":"2026-05-17T23:46:57.412719+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZLF4OLGMDKN","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZLF4OLGMDKNMF3Q","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZLF4OLG","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH","json":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH.json","graph_json":"https://pith.science/api/pith-number/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/graph.json","events_json":"https://pith.science/api/pith-number/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/events.json","paper":"https://pith.science/paper/EZLF4OLG"},"agent_actions":{"view_html":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH","download_json":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH.json","view_paper":"https://pith.science/paper/EZLF4OLG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01788&json=true","fetch_graph":"https://pith.science/api/pith-number/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/graph.json","fetch_events":"https://pith.science/api/pith-number/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/action/storage_attestation","attest_author":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/action/author_attestation","sign_citation":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/action/citation_signature","submit_replication":"https://pith.science/pith/EZLF4OLGMDKNMF3QJ4JQ3BYAGH/action/replication_record"}},"created_at":"2026-05-17T23:46:57.412719+00:00","updated_at":"2026-05-17T23:46:57.412719+00:00"}