{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HLB6FLRU7LWGXZDOELD2WHUNP6","short_pith_number":"pith:HLB6FLRU","schema_version":"1.0","canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","source":{"kind":"arxiv","id":"1811.02089","version":1},"attestation_state":"computed","paper":{"title":"Motif and Hypergraph Correlation Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.SI"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo, Olgica Milenkovic, Pan Li","submitted_at":"2018-11-05T23:40:03Z","abstract_excerpt":"Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\\emph{motif correlation clustering}, which aims to minimize the cost of clustering errors associated with both edges and higher-order network structures. The problem may be succinctly described as follows: Given a complete graph $G$, partition the vertices of the graph so that certain predetermined `important' subgraphs mostly lie within the same cluster, while `less relevant' subgraphs are allowed to lie across clusters. Our contributions are as follows: We first introduc"},"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":"1811.02089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-05T23:40:03Z","cross_cats_sorted":["cs.DM","cs.LG","cs.SI"],"title_canon_sha256":"bacea66d63691a762394feba087dd39249d1b44820b5fb390f0afda73f914332","abstract_canon_sha256":"50a0395f617c140b072ca4020bf9ca78d84a077f014e0d2ab74a5a40f5836821"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:25.068030Z","signature_b64":"r2heiwo/xk1t5gkajU8ZAkDBC9q3u64OF/8LYvEz9rWZUD7bOgcEbj0vOzxg3Dfa5S8g2XhdxrnNA0HInzG+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","last_reissued_at":"2026-05-18T00:01:25.067628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:25.067628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motif and Hypergraph Correlation Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG","cs.SI"],"primary_cat":"cs.DS","authors_text":"Gregory J. Puleo, Olgica Milenkovic, Pan Li","submitted_at":"2018-11-05T23:40:03Z","abstract_excerpt":"Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\\emph{motif correlation clustering}, which aims to minimize the cost of clustering errors associated with both edges and higher-order network structures. The problem may be succinctly described as follows: Given a complete graph $G$, partition the vertices of the graph so that certain predetermined `important' subgraphs mostly lie within the same cluster, while `less relevant' subgraphs are allowed to lie across clusters. Our contributions are as follows: We first introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02089","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":"1811.02089","created_at":"2026-05-18T00:01:25.067691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02089v1","created_at":"2026-05-18T00:01:25.067691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02089","created_at":"2026-05-18T00:01:25.067691+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLB6FLRU7LWG","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLB6FLRU7LWGXZDO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLB6FLRU","created_at":"2026-05-18T12:32:28.185984+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/HLB6FLRU7LWGXZDOELD2WHUNP6","json":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6.json","graph_json":"https://pith.science/api/pith-number/HLB6FLRU7LWGXZDOELD2WHUNP6/graph.json","events_json":"https://pith.science/api/pith-number/HLB6FLRU7LWGXZDOELD2WHUNP6/events.json","paper":"https://pith.science/paper/HLB6FLRU"},"agent_actions":{"view_html":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6","download_json":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6.json","view_paper":"https://pith.science/paper/HLB6FLRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02089&json=true","fetch_graph":"https://pith.science/api/pith-number/HLB6FLRU7LWGXZDOELD2WHUNP6/graph.json","fetch_events":"https://pith.science/api/pith-number/HLB6FLRU7LWGXZDOELD2WHUNP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/action/storage_attestation","attest_author":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/action/author_attestation","sign_citation":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/action/citation_signature","submit_replication":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/action/replication_record"}},"created_at":"2026-05-18T00:01:25.067691+00:00","updated_at":"2026-05-18T00:01:25.067691+00:00"}