{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RAYVWG5BQRN46YRDD3TNXIYKZF","short_pith_number":"pith:RAYVWG5B","canonical_record":{"source":{"id":"2601.11171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-01-16T10:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"a978b45b598e063567cb7a7b62697f380a18eff968f122824f86c0dcd4525b7e","abstract_canon_sha256":"46c2cd3bbbe41a5cc1c065cd13cf5233de7927a69549e2238ac70849d8f8e066"},"schema_version":"1.0"},"canonical_sha256":"88315b1ba1845bcf62231ee6dba30ac94643860cc97379e701920aa801b44f6e","source":{"kind":"arxiv","id":"2601.11171","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.11171","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"2601.11171v2","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.11171","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"RAYVWG5BQRN4","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_16","alias_value":"RAYVWG5BQRN46YRD","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_8","alias_value":"RAYVWG5B","created_at":"2026-05-20T00:05:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RAYVWG5BQRN46YRDD3TNXIYKZF","target":"record","payload":{"canonical_record":{"source":{"id":"2601.11171","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-01-16T10:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"a978b45b598e063567cb7a7b62697f380a18eff968f122824f86c0dcd4525b7e","abstract_canon_sha256":"46c2cd3bbbe41a5cc1c065cd13cf5233de7927a69549e2238ac70849d8f8e066"},"schema_version":"1.0"},"canonical_sha256":"88315b1ba1845bcf62231ee6dba30ac94643860cc97379e701920aa801b44f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:40.578855Z","signature_b64":"b/T1nx8MRcSgfPbH7kHr35rU4ezp2uclbdZHAFTD3e86ERTlffeuhq0xjcdj/HYR3/45r6Cca+roGrC2VoNOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88315b1ba1845bcf62231ee6dba30ac94643860cc97379e701920aa801b44f6e","last_reissued_at":"2026-05-20T00:05:40.578224Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:40.578224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.11171","source_version":2,"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-20T00:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRGVcJnsS66QfEqqb6vqwhIpSzkLjAJrAF9QlE6MyJAOoU0Z2OYkE1KdeNLm9M4CJuKFQ8CwbTrip7wMLsg+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:53:40.922624Z"},"content_sha256":"41b322eca7c971c8e2f67081725f68873a68ea45ffd3f6cdef9eedb101592bfd","schema_version":"1.0","event_id":"sha256:41b322eca7c971c8e2f67081725f68873a68ea45ffd3f6cdef9eedb101592bfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RAYVWG5BQRN46YRDD3TNXIYKZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Noisy Graph Patterns via Ordered Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.HC","authors_text":"Bettina Speckmann, Jules Wulms, Wouter Meulemans","submitted_at":"2026-01-16T10:41:32Z","abstract_excerpt":"The high-level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard. (2) Real-world graphs contain noise, and therefore do not always exhibit patterns in their pure form. Defining meaningful noisy patterns and detecting them efficiently is a currently unsolved challenge. In this paper, we propose to use well-ordered matrices as a tool to both define"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.11171","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.11171/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"},"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-20T00:05:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLciOc/NbOXmql9TzoUfMiHSv/7E3SBubeS3ZYSix//WxUfFYi/Cm12XkAYMHNYz8qyxxE8wkMKH3AXZKrH3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:53:40.923006Z"},"content_sha256":"6436a81363d9d439e3a4dc213ba53b8cfa11112e016c199be466db6632c2bd17","schema_version":"1.0","event_id":"sha256:6436a81363d9d439e3a4dc213ba53b8cfa11112e016c199be466db6632c2bd17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/bundle.json","state_url":"https://pith.science/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/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-03T17:53:40Z","links":{"resolver":"https://pith.science/pith/RAYVWG5BQRN46YRDD3TNXIYKZF","bundle":"https://pith.science/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/bundle.json","state":"https://pith.science/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAYVWG5BQRN46YRDD3TNXIYKZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RAYVWG5BQRN46YRDD3TNXIYKZF","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":"46c2cd3bbbe41a5cc1c065cd13cf5233de7927a69549e2238ac70849d8f8e066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-01-16T10:41:32Z","title_canon_sha256":"a978b45b598e063567cb7a7b62697f380a18eff968f122824f86c0dcd4525b7e"},"schema_version":"1.0","source":{"id":"2601.11171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.11171","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"arxiv_version","alias_value":"2601.11171v2","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.11171","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_12","alias_value":"RAYVWG5BQRN4","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_16","alias_value":"RAYVWG5BQRN46YRD","created_at":"2026-05-20T00:05:40Z"},{"alias_kind":"pith_short_8","alias_value":"RAYVWG5B","created_at":"2026-05-20T00:05:40Z"}],"graph_snapshots":[{"event_id":"sha256:6436a81363d9d439e3a4dc213ba53b8cfa11112e016c199be466db6632c2bd17","target":"graph","created_at":"2026-05-20T00:05:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.11171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The high-level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard. (2) Real-world graphs contain noise, and therefore do not always exhibit patterns in their pure form. Defining meaningful noisy patterns and detecting them efficiently is a currently unsolved challenge. In this paper, we propose to use well-ordered matrices as a tool to both define","authors_text":"Bettina Speckmann, Jules Wulms, Wouter Meulemans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-01-16T10:41:32Z","title":"Noisy Graph Patterns via Ordered Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.11171","kind":"arxiv","version":2},"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:41b322eca7c971c8e2f67081725f68873a68ea45ffd3f6cdef9eedb101592bfd","target":"record","created_at":"2026-05-20T00:05:40Z","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":"46c2cd3bbbe41a5cc1c065cd13cf5233de7927a69549e2238ac70849d8f8e066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2026-01-16T10:41:32Z","title_canon_sha256":"a978b45b598e063567cb7a7b62697f380a18eff968f122824f86c0dcd4525b7e"},"schema_version":"1.0","source":{"id":"2601.11171","kind":"arxiv","version":2}},"canonical_sha256":"88315b1ba1845bcf62231ee6dba30ac94643860cc97379e701920aa801b44f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88315b1ba1845bcf62231ee6dba30ac94643860cc97379e701920aa801b44f6e","first_computed_at":"2026-05-20T00:05:40.578224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:40.578224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b/T1nx8MRcSgfPbH7kHr35rU4ezp2uclbdZHAFTD3e86ERTlffeuhq0xjcdj/HYR3/45r6Cca+roGrC2VoNOAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:40.578855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.11171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41b322eca7c971c8e2f67081725f68873a68ea45ffd3f6cdef9eedb101592bfd","sha256:6436a81363d9d439e3a4dc213ba53b8cfa11112e016c199be466db6632c2bd17"],"state_sha256":"ab62cdf1feaa73de38e27f40399902cd831b54defaa5328777105a7746688b5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s40n4PbrbrTbf02cHtVticWJjTotAut5Zm5hQGJp5G3z6vi6e4uMqj6WwKGYRd40sLrFPS4XQJu9SSux1NYGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:53:40.924996Z","bundle_sha256":"56ee5cc1ba71fcec43d0031372e5313fb144092003b7c3832e14ce645046aee8"}}