{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:43KC3RHIEQQQQPTZ7P5H4KJK4O","short_pith_number":"pith:43KC3RHI","schema_version":"1.0","canonical_sha256":"e6d42dc4e82421083e79fbfa7e292ae3a4f6346b42677bb0736015e954959b2c","source":{"kind":"arxiv","id":"2410.22984","version":1},"attestation_state":"computed","paper":{"title":"Higher-order Cross-structural Embedding Model for Time Series Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aijing Lin, Cong Shen, Guancen Lin","submitted_at":"2024-10-30T12:51:14Z","abstract_excerpt":"Time series analysis has gained significant attention due to its critical applications in diverse fields such as healthcare, finance, and sensor networks. The complexity and non-stationarity of time series make it challenging to capture the interaction patterns across different timestamps. Current approaches struggle to model higher-order interactions within time series, and focus on learning temporal or spatial dependencies separately, which limits performance in downstream tasks. To address these gaps, we propose Higher-order Cross-structural Embedding Model for Time Series (High-TS), a nove"},"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":"2410.22984","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-30T12:51:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f330b6876cf6b5fcdbf63b099d951fc535c875cc4e2a465cee13c22bfb389628","abstract_canon_sha256":"7c4eda3105c7fa88fd635f5e60e514269d89d54b13bf4e129b38703755065927"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:39.557288Z","signature_b64":"fALGubmr29ts80iuZzbFw+nepNiy2q4vDnX9WOAdZnmmfHdjkZZBHZUv3Nf4/R8uLzSFgEJTeC3D6oqRV0RnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d42dc4e82421083e79fbfa7e292ae3a4f6346b42677bb0736015e954959b2c","last_reissued_at":"2026-07-05T09:28:39.556716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:39.556716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Cross-structural Embedding Model for Time Series Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Aijing Lin, Cong Shen, Guancen Lin","submitted_at":"2024-10-30T12:51:14Z","abstract_excerpt":"Time series analysis has gained significant attention due to its critical applications in diverse fields such as healthcare, finance, and sensor networks. The complexity and non-stationarity of time series make it challenging to capture the interaction patterns across different timestamps. Current approaches struggle to model higher-order interactions within time series, and focus on learning temporal or spatial dependencies separately, which limits performance in downstream tasks. To address these gaps, we propose Higher-order Cross-structural Embedding Model for Time Series (High-TS), a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.22984","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.22984/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.22984","created_at":"2026-07-05T09:28:39.556775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.22984v1","created_at":"2026-07-05T09:28:39.556775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.22984","created_at":"2026-07-05T09:28:39.556775+00:00"},{"alias_kind":"pith_short_12","alias_value":"43KC3RHIEQQQ","created_at":"2026-07-05T09:28:39.556775+00:00"},{"alias_kind":"pith_short_16","alias_value":"43KC3RHIEQQQQPTZ","created_at":"2026-07-05T09:28:39.556775+00:00"},{"alias_kind":"pith_short_8","alias_value":"43KC3RHI","created_at":"2026-07-05T09:28:39.556775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19456","citing_title":"ReLATE+: Unified Framework for Adversarial Attack Detection, Classification, and Resilient Model Selection in Time-Series Classification","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O","json":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O.json","graph_json":"https://pith.science/api/pith-number/43KC3RHIEQQQQPTZ7P5H4KJK4O/graph.json","events_json":"https://pith.science/api/pith-number/43KC3RHIEQQQQPTZ7P5H4KJK4O/events.json","paper":"https://pith.science/paper/43KC3RHI"},"agent_actions":{"view_html":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O","download_json":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O.json","view_paper":"https://pith.science/paper/43KC3RHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.22984&json=true","fetch_graph":"https://pith.science/api/pith-number/43KC3RHIEQQQQPTZ7P5H4KJK4O/graph.json","fetch_events":"https://pith.science/api/pith-number/43KC3RHIEQQQQPTZ7P5H4KJK4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O/action/storage_attestation","attest_author":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O/action/author_attestation","sign_citation":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O/action/citation_signature","submit_replication":"https://pith.science/pith/43KC3RHIEQQQQPTZ7P5H4KJK4O/action/replication_record"}},"created_at":"2026-07-05T09:28:39.556775+00:00","updated_at":"2026-07-05T09:28:39.556775+00:00"}