{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HLB6FLRU7LWGXZDOELD2WHUNP6","short_pith_number":"pith:HLB6FLRU","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"},"canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","source":{"kind":"arxiv","id":"1811.02089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02089","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02089v1","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02089","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLB6FLRU7LWG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HLB6FLRU7LWGXZDO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HLB6FLRU","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HLB6FLRU7LWGXZDOELD2WHUNP6","target":"record","payload":{"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"},"canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","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"},"source_kind":"arxiv","source_id":"1811.02089","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J66p4RmHmh+CgxL6p7PApN8JTj+DKayr3OWittwOh278deNgrg6qnhML1qzfUKoQf3JdEOTUVY9mRXNQ4EgTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:38:37.076611Z"},"content_sha256":"9da4891e0c7eda8fc6c6439eec86a134585573a7f44bb4bdec954fd2235088d3","schema_version":"1.0","event_id":"sha256:9da4891e0c7eda8fc6c6439eec86a134585573a7f44bb4bdec954fd2235088d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HLB6FLRU7LWGXZDOELD2WHUNP6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5c8ZlIRamhL7W5IO6lr0qim5fhOHpeMWqw0McywoWISdaFTULRrhaEYXY3xoVJRcujfYPMG4oFw9jJu8Z7XiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:38:37.077210Z"},"content_sha256":"19cbf1b886dafad4f7492aeaeb149d47bddae9ee7eeeccbdd85a7126921cbd1c","schema_version":"1.0","event_id":"sha256:19cbf1b886dafad4f7492aeaeb149d47bddae9ee7eeeccbdd85a7126921cbd1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/bundle.json","state_url":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T17:38:37Z","links":{"resolver":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6","bundle":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/bundle.json","state":"https://pith.science/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HLB6FLRU7LWGXZDOELD2WHUNP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HLB6FLRU7LWGXZDOELD2WHUNP6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"50a0395f617c140b072ca4020bf9ca78d84a077f014e0d2ab74a5a40f5836821","cross_cats_sorted":["cs.DM","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-05T23:40:03Z","title_canon_sha256":"bacea66d63691a762394feba087dd39249d1b44820b5fb390f0afda73f914332"},"schema_version":"1.0","source":{"id":"1811.02089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02089","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02089v1","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02089","created_at":"2026-05-18T00:01:25Z"},{"alias_kind":"pith_short_12","alias_value":"HLB6FLRU7LWG","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HLB6FLRU7LWGXZDO","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HLB6FLRU","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:19cbf1b886dafad4f7492aeaeb149d47bddae9ee7eeeccbdd85a7126921cbd1c","target":"graph","created_at":"2026-05-18T00:01:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gregory J. Puleo, Olgica Milenkovic, Pan Li","cross_cats":["cs.DM","cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-05T23:40:03Z","title":"Motif and Hypergraph Correlation Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02089","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9da4891e0c7eda8fc6c6439eec86a134585573a7f44bb4bdec954fd2235088d3","target":"record","created_at":"2026-05-18T00:01:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"50a0395f617c140b072ca4020bf9ca78d84a077f014e0d2ab74a5a40f5836821","cross_cats_sorted":["cs.DM","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-05T23:40:03Z","title_canon_sha256":"bacea66d63691a762394feba087dd39249d1b44820b5fb390f0afda73f914332"},"schema_version":"1.0","source":{"id":"1811.02089","kind":"arxiv","version":1}},"canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ac3e2ae34faec6be46e22c7ab1e8d7f81efa53b6e2bb9f4b1556e220ccf3b76","first_computed_at":"2026-05-18T00:01:25.067628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:25.067628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2heiwo/xk1t5gkajU8ZAkDBC9q3u64OF/8LYvEz9rWZUD7bOgcEbj0vOzxg3Dfa5S8g2XhdxrnNA0HInzG+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:25.068030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9da4891e0c7eda8fc6c6439eec86a134585573a7f44bb4bdec954fd2235088d3","sha256:19cbf1b886dafad4f7492aeaeb149d47bddae9ee7eeeccbdd85a7126921cbd1c"],"state_sha256":"d67142401d7b023e9bda8b83294136c76b10d990ae0b68e5b0b3f9333b57fb6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHGKONzS08VZNEuCNj7ckoL0sXRw8QHnhRpHwJEDEjuuLmPD0dRQ2kp7Le2MMJCecBRkc07e21qrskTolLXuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:38:37.079214Z","bundle_sha256":"0ea6d961c5ceaa028f938a5a6e15975e611c88c149e92ceb25b493bd1154c131"}}