{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MYZELD52WPFNAGYOS32344ZYDC","short_pith_number":"pith:MYZELD52","schema_version":"1.0","canonical_sha256":"6632458fbab3cad01b0e96f5be733818b016855ba6143b628752008db42c63ec","source":{"kind":"arxiv","id":"1507.03044","version":2},"attestation_state":"computed","paper":{"title":"Persistent Homology Lower Bounds on High Order Network Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Weiyu Huang","submitted_at":"2015-07-10T23:14:30Z","abstract_excerpt":"High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the number of nodes is large. The goal here is to find tractable approximations of these network distances. The paper does so by mapping high order networks to filtrations of simplicial complexes and showing that the distance between networks can be lower bounded by the difference between the homological features of their respective filtrations. Practical implication"},"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":"1507.03044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-07-10T23:14:30Z","cross_cats_sorted":[],"title_canon_sha256":"df1a56450407b170b7c3b9c523e890fec26982208304c2a9d823c14eb25aa1a8","abstract_canon_sha256":"558f19d73f5c47c69d098f07785dc7a0b07322add2e762458e4dfaab1c4a2441"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:52.747504Z","signature_b64":"EeQAhZVWws6wnq1REjKgBiGKgwkdm3+v4i8aknPo2ChpsLxWefDLBJAuD8Qp5xvrI8uBxgYu2ZH+TVWDbilDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6632458fbab3cad01b0e96f5be733818b016855ba6143b628752008db42c63ec","last_reissued_at":"2026-05-18T01:15:52.747067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:52.747067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent Homology Lower Bounds on High Order Network Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alejandro Ribeiro, Weiyu Huang","submitted_at":"2015-07-10T23:14:30Z","abstract_excerpt":"High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the number of nodes is large. The goal here is to find tractable approximations of these network distances. The paper does so by mapping high order networks to filtrations of simplicial complexes and showing that the distance between networks can be lower bounded by the difference between the homological features of their respective filtrations. Practical implication"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03044","kind":"arxiv","version":2},"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":"1507.03044","created_at":"2026-05-18T01:15:52.747131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03044v2","created_at":"2026-05-18T01:15:52.747131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03044","created_at":"2026-05-18T01:15:52.747131+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYZELD52WPFN","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYZELD52WPFNAGYO","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYZELD52","created_at":"2026-05-18T12:29:32.376354+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/MYZELD52WPFNAGYOS32344ZYDC","json":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC.json","graph_json":"https://pith.science/api/pith-number/MYZELD52WPFNAGYOS32344ZYDC/graph.json","events_json":"https://pith.science/api/pith-number/MYZELD52WPFNAGYOS32344ZYDC/events.json","paper":"https://pith.science/paper/MYZELD52"},"agent_actions":{"view_html":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC","download_json":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC.json","view_paper":"https://pith.science/paper/MYZELD52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03044&json=true","fetch_graph":"https://pith.science/api/pith-number/MYZELD52WPFNAGYOS32344ZYDC/graph.json","fetch_events":"https://pith.science/api/pith-number/MYZELD52WPFNAGYOS32344ZYDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC/action/storage_attestation","attest_author":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC/action/author_attestation","sign_citation":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC/action/citation_signature","submit_replication":"https://pith.science/pith/MYZELD52WPFNAGYOS32344ZYDC/action/replication_record"}},"created_at":"2026-05-18T01:15:52.747131+00:00","updated_at":"2026-05-18T01:15:52.747131+00:00"}