{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TDME3DHTSM76DUJJ6SFYJ3L7WH","short_pith_number":"pith:TDME3DHT","schema_version":"1.0","canonical_sha256":"98d84d8cf3933fe1d129f48b84ed7fb1ef8b8d51a467bdb2d06ec25db8d603b3","source":{"kind":"arxiv","id":"1712.09658","version":3},"attestation_state":"computed","paper":{"title":"Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bruno Ribeiro, Jian Xu, Lance M. Kaplan, Mandana Saebi, Nitesh V. Chawla","submitted_at":"2017-12-27T19:11:29Z","abstract_excerpt":"Complex systems, represented as dynamic networks, comprise of components that influence each other via direct and/or indirect interactions. Recent research has shown the importance of using Higher-Order Networks (HONs) for modeling and analyzing such complex systems, as the typical Markovian assumption in developing the First Order Network (FON) can be limiting. This higher-order network representation not only creates a more accurate representation of the underlying complex system, but also leads to more accurate network analysis. In this paper, we first present a scalable and accurate model,"},"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":"1712.09658","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-12-27T19:11:29Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"b2e81831d3e0b92ed87f7b2bb2855ecac4ca95a5ff682d9cb1eff323979576ec","abstract_canon_sha256":"0afb5808f1380ad27bbaf212d0d5d9d61875827753506d3924d14ade0542dcf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:46.249176Z","signature_b64":"3z7/gJKSRpGPaJopbENruz8pTagnz1/hn1ZVjlrHHrzNFQ45YSs+WkYOVBcDohV2Mao4FpXnMFYkW27xn3uzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d84d8cf3933fe1d129f48b84ed7fb1ef8b8d51a467bdb2d06ec25db8d603b3","last_reissued_at":"2026-07-05T01:41:46.248710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:46.248710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient modeling of higher-order dependencies in networks: from algorithm to application for anomaly detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bruno Ribeiro, Jian Xu, Lance M. Kaplan, Mandana Saebi, Nitesh V. Chawla","submitted_at":"2017-12-27T19:11:29Z","abstract_excerpt":"Complex systems, represented as dynamic networks, comprise of components that influence each other via direct and/or indirect interactions. Recent research has shown the importance of using Higher-Order Networks (HONs) for modeling and analyzing such complex systems, as the typical Markovian assumption in developing the First Order Network (FON) can be limiting. This higher-order network representation not only creates a more accurate representation of the underlying complex system, but also leads to more accurate network analysis. In this paper, we first present a scalable and accurate model,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09658","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.09658/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":"1712.09658","created_at":"2026-07-05T01:41:46.248775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09658v3","created_at":"2026-07-05T01:41:46.248775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09658","created_at":"2026-07-05T01:41:46.248775+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDME3DHTSM76","created_at":"2026-07-05T01:41:46.248775+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDME3DHTSM76DUJJ","created_at":"2026-07-05T01:41:46.248775+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDME3DHT","created_at":"2026-07-05T01:41:46.248775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1908.05387","citing_title":"HONEM: Learning Embedding for Higher Order Networks","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH","json":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH.json","graph_json":"https://pith.science/api/pith-number/TDME3DHTSM76DUJJ6SFYJ3L7WH/graph.json","events_json":"https://pith.science/api/pith-number/TDME3DHTSM76DUJJ6SFYJ3L7WH/events.json","paper":"https://pith.science/paper/TDME3DHT"},"agent_actions":{"view_html":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH","download_json":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH.json","view_paper":"https://pith.science/paper/TDME3DHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09658&json=true","fetch_graph":"https://pith.science/api/pith-number/TDME3DHTSM76DUJJ6SFYJ3L7WH/graph.json","fetch_events":"https://pith.science/api/pith-number/TDME3DHTSM76DUJJ6SFYJ3L7WH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH/action/storage_attestation","attest_author":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH/action/author_attestation","sign_citation":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH/action/citation_signature","submit_replication":"https://pith.science/pith/TDME3DHTSM76DUJJ6SFYJ3L7WH/action/replication_record"}},"created_at":"2026-07-05T01:41:46.248775+00:00","updated_at":"2026-07-05T01:41:46.248775+00:00"}