{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EL4GHX5NKOI3JW4JAVPQUFWUVK","short_pith_number":"pith:EL4GHX5N","canonical_record":{"source":{"id":"2506.09866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-11T15:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"732caac3ef86309a40321304ace2ee9d162314597c450f3a055af74525cfbd63","abstract_canon_sha256":"8347e0d2b6c29e0ab6a0df1549fc31775ba224c35626dd2a2e9662b6da81208a"},"schema_version":"1.0"},"canonical_sha256":"22f863dfad5391b4db89055f0a16d4aa9202f62e680c564c95e04fc8f8c6837d","source":{"kind":"arxiv","id":"2506.09866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09866","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09866v1","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09866","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"EL4GHX5NKOI3","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_16","alias_value":"EL4GHX5NKOI3JW4J","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_8","alias_value":"EL4GHX5N","created_at":"2026-07-05T11:19:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EL4GHX5NKOI3JW4JAVPQUFWUVK","target":"record","payload":{"canonical_record":{"source":{"id":"2506.09866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-11T15:39:51Z","cross_cats_sorted":[],"title_canon_sha256":"732caac3ef86309a40321304ace2ee9d162314597c450f3a055af74525cfbd63","abstract_canon_sha256":"8347e0d2b6c29e0ab6a0df1549fc31775ba224c35626dd2a2e9662b6da81208a"},"schema_version":"1.0"},"canonical_sha256":"22f863dfad5391b4db89055f0a16d4aa9202f62e680c564c95e04fc8f8c6837d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:58.145497Z","signature_b64":"RVzU7iNIV+TUcDem4OHpWC5IgSDjxUMwvewCiS4BUEg5w7o4odB7PXAbW8W8bjKOaBJvvucsFxVRJxvBJsZ9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22f863dfad5391b4db89055f0a16d4aa9202f62e680c564c95e04fc8f8c6837d","last_reissued_at":"2026-07-05T11:19:58.145008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:58.145008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.09866","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-07-05T11:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AUeEI1Q6+o1WY7Wi64NI79avJcshd0AMEX1eOE/dzcCkKTjVXnOjn1BOKOh8cNJc89ggAwUx+iokKNlQdeLQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:59:11.367911Z"},"content_sha256":"2353199aa9c74384c9a00ec42364d7828aa74862cf2a5e4d3e7e7b7ccce3c145","schema_version":"1.0","event_id":"sha256:2353199aa9c74384c9a00ec42364d7828aa74862cf2a5e4d3e7e7b7ccce3c145"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EL4GHX5NKOI3JW4JAVPQUFWUVK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ELRUHNA: Elimination Rule-basedHypergraph Alignment","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cameron Ibrahim, Ilya Safro, Mahantesh Halappanavar, Marco Minutoli, S M Ferdous","submitted_at":"2025-06-11T15:39:51Z","abstract_excerpt":"Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despite its computational complexity, practical and scalable solutions are urgently needed to enable pattern discovery and entity correspondence in high-order relational data. The problem remains understudied in contrast to its graph based counterpart. In this paper, we propose ELRUHNA, an elimination rule-based framework for unsupervised hypergraph alignment that operates on the bipartite representation of hypergraphs. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09866","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.09866/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-07-05T11:19:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xaq6hfUD/5gpJQVu/6t4Wdo5ioaQejDAKMeiJZvjAFRnUfxhnSyp+kVOV8HhaNRXtiwtQ6vWHbAuMxUiNOflBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:59:11.368722Z"},"content_sha256":"4db8a32cfd981608bb7bcd411ec26cdb46187983bd73fd55952d8cda80fd88b1","schema_version":"1.0","event_id":"sha256:4db8a32cfd981608bb7bcd411ec26cdb46187983bd73fd55952d8cda80fd88b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/bundle.json","state_url":"https://pith.science/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/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-08-21T21:59:11Z","links":{"resolver":"https://pith.science/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK","bundle":"https://pith.science/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/bundle.json","state":"https://pith.science/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EL4GHX5NKOI3JW4JAVPQUFWUVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EL4GHX5NKOI3JW4JAVPQUFWUVK","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":"8347e0d2b6c29e0ab6a0df1549fc31775ba224c35626dd2a2e9662b6da81208a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-11T15:39:51Z","title_canon_sha256":"732caac3ef86309a40321304ace2ee9d162314597c450f3a055af74525cfbd63"},"schema_version":"1.0","source":{"id":"2506.09866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.09866","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"arxiv_version","alias_value":"2506.09866v1","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09866","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_12","alias_value":"EL4GHX5NKOI3","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_16","alias_value":"EL4GHX5NKOI3JW4J","created_at":"2026-07-05T11:19:58Z"},{"alias_kind":"pith_short_8","alias_value":"EL4GHX5N","created_at":"2026-07-05T11:19:58Z"}],"graph_snapshots":[{"event_id":"sha256:4db8a32cfd981608bb7bcd411ec26cdb46187983bd73fd55952d8cda80fd88b1","target":"graph","created_at":"2026-07-05T11:19:58Z","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/2506.09866/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despite its computational complexity, practical and scalable solutions are urgently needed to enable pattern discovery and entity correspondence in high-order relational data. The problem remains understudied in contrast to its graph based counterpart. In this paper, we propose ELRUHNA, an elimination rule-based framework for unsupervised hypergraph alignment that operates on the bipartite representation of hypergraphs. W","authors_text":"Cameron Ibrahim, Ilya Safro, Mahantesh Halappanavar, Marco Minutoli, S M Ferdous","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-11T15:39:51Z","title":"ELRUHNA: Elimination Rule-basedHypergraph Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09866","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:2353199aa9c74384c9a00ec42364d7828aa74862cf2a5e4d3e7e7b7ccce3c145","target":"record","created_at":"2026-07-05T11:19:58Z","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":"8347e0d2b6c29e0ab6a0df1549fc31775ba224c35626dd2a2e9662b6da81208a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-11T15:39:51Z","title_canon_sha256":"732caac3ef86309a40321304ace2ee9d162314597c450f3a055af74525cfbd63"},"schema_version":"1.0","source":{"id":"2506.09866","kind":"arxiv","version":1}},"canonical_sha256":"22f863dfad5391b4db89055f0a16d4aa9202f62e680c564c95e04fc8f8c6837d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22f863dfad5391b4db89055f0a16d4aa9202f62e680c564c95e04fc8f8c6837d","first_computed_at":"2026-07-05T11:19:58.145008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:58.145008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVzU7iNIV+TUcDem4OHpWC5IgSDjxUMwvewCiS4BUEg5w7o4odB7PXAbW8W8bjKOaBJvvucsFxVRJxvBJsZ9AA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:58.145497Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.09866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2353199aa9c74384c9a00ec42364d7828aa74862cf2a5e4d3e7e7b7ccce3c145","sha256:4db8a32cfd981608bb7bcd411ec26cdb46187983bd73fd55952d8cda80fd88b1"],"state_sha256":"167bbe8fab6c9edad35bc616452e28be2ba39fe75ba88caa9bf83179c4cdcccb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMV+HuSlcbIJD/b5L7d5oy15Hy09nkNDSPT8ypUecOgPmvFcNkwR7sGjoNGyuEygURq1ghBvmdA39fjB5b1pBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T21:59:11.374122Z","bundle_sha256":"cb87f34a36b6d53d89100282675e7bbc8368a96c4832f050db294f5a22466fda"}}