{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:AKKRK73PEN26AYCUTP7SRAUMCE","short_pith_number":"pith:AKKRK73P","canonical_record":{"source":{"id":"2301.06426","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-16T13:31:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"79204c7cfc6f4c02f3ea0f23381e1fea9c28751b01bb477e60991233a22b8997","abstract_canon_sha256":"73faf81a3cfbaaae1143b98fa4de9d65a1510e48395e7605e895995102eef62a"},"schema_version":"1.0"},"canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","source":{"kind":"arxiv","id":"2301.06426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.06426","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"arxiv_version","alias_value":"2301.06426v2","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06426","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_12","alias_value":"AKKRK73PEN26","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_16","alias_value":"AKKRK73PEN26AYCU","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_8","alias_value":"AKKRK73P","created_at":"2026-07-05T05:59:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:AKKRK73PEN26AYCUTP7SRAUMCE","target":"record","payload":{"canonical_record":{"source":{"id":"2301.06426","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-16T13:31:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"79204c7cfc6f4c02f3ea0f23381e1fea9c28751b01bb477e60991233a22b8997","abstract_canon_sha256":"73faf81a3cfbaaae1143b98fa4de9d65a1510e48395e7605e895995102eef62a"},"schema_version":"1.0"},"canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:06.029305Z","signature_b64":"B9+jHjDDC3nfK3+jGstpUV1KK/q5ug/AEBjHbFClu3VMhBK/tSiEQgeiqrklwIFW98STzNOmrQqLK/YH0EdJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","last_reissued_at":"2026-07-05T05:59:06.028811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:06.028811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.06426","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-07-05T05:59:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2A0qo8Ap9p9pPVfP3c17eTyg7GZzNgXLTxQvoSUAs6LEXShlDYZqyhN8qfuqVwuZFHuOM/fCAku+7Ra5Fc37CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:18:05.239597Z"},"content_sha256":"64c83ac69dfdfc5ba2254f078d05be47ed690cb188cdb2d22b015aa2c560dde5","schema_version":"1.0","event_id":"sha256:64c83ac69dfdfc5ba2254f078d05be47ed690cb188cdb2d22b015aa2c560dde5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:AKKRK73PEN26AYCUTP7SRAUMCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighborhood-based Hypergraph Core Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Arijit Khan, Arpit Kumar Rai, Bishwamittra Ghosh, Naheed Anjum Arafat","submitted_at":"2023-01-16T13:31:01Z","abstract_excerpt":"We propose neighborhood-based core decomposition: a novel way of decomposing hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative approaches to decomposing hypergraphs, e.g., reduction to clique or bipartite graphs, are not meaningful in certain applications, the later also results in inefficient decomposition; while existing degree-based hypergraph decomposition does not distinguish nodes with different neighborhood sizes. Our case studies show that the proposed decomposition is more effective than degree and clique graph-based decompositions in disease intervention"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.06426","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/2301.06426/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-05T05:59:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ribi1q75/VzciKizyVHb/VRK1OZHvstP3kr/Y0ErNebaIbw5NJ1uk3Zt1AVZxbePtE/WsJI+Nkp2bthrKaXACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:18:05.239984Z"},"content_sha256":"294798f814bc06570ff4874a1dfc87b39f2bc47c2167df3da9275a6e93a82b77","schema_version":"1.0","event_id":"sha256:294798f814bc06570ff4874a1dfc87b39f2bc47c2167df3da9275a6e93a82b77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/bundle.json","state_url":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKKRK73PEN26AYCUTP7SRAUMCE/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-07-07T06:18:05Z","links":{"resolver":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE","bundle":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/bundle.json","state":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKKRK73PEN26AYCUTP7SRAUMCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AKKRK73PEN26AYCUTP7SRAUMCE","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":"73faf81a3cfbaaae1143b98fa4de9d65a1510e48395e7605e895995102eef62a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-16T13:31:01Z","title_canon_sha256":"79204c7cfc6f4c02f3ea0f23381e1fea9c28751b01bb477e60991233a22b8997"},"schema_version":"1.0","source":{"id":"2301.06426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.06426","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"arxiv_version","alias_value":"2301.06426v2","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06426","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_12","alias_value":"AKKRK73PEN26","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_16","alias_value":"AKKRK73PEN26AYCU","created_at":"2026-07-05T05:59:06Z"},{"alias_kind":"pith_short_8","alias_value":"AKKRK73P","created_at":"2026-07-05T05:59:06Z"}],"graph_snapshots":[{"event_id":"sha256:294798f814bc06570ff4874a1dfc87b39f2bc47c2167df3da9275a6e93a82b77","target":"graph","created_at":"2026-07-05T05:59:06Z","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/2301.06426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose neighborhood-based core decomposition: a novel way of decomposing hypergraphs into hierarchical neighborhood-cohesive subhypergraphs. Alternative approaches to decomposing hypergraphs, e.g., reduction to clique or bipartite graphs, are not meaningful in certain applications, the later also results in inefficient decomposition; while existing degree-based hypergraph decomposition does not distinguish nodes with different neighborhood sizes. Our case studies show that the proposed decomposition is more effective than degree and clique graph-based decompositions in disease intervention","authors_text":"Arijit Khan, Arpit Kumar Rai, Bishwamittra Ghosh, Naheed Anjum Arafat","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-16T13:31:01Z","title":"Neighborhood-based Hypergraph Core Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.06426","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:64c83ac69dfdfc5ba2254f078d05be47ed690cb188cdb2d22b015aa2c560dde5","target":"record","created_at":"2026-07-05T05:59:06Z","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":"73faf81a3cfbaaae1143b98fa4de9d65a1510e48395e7605e895995102eef62a","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-01-16T13:31:01Z","title_canon_sha256":"79204c7cfc6f4c02f3ea0f23381e1fea9c28751b01bb477e60991233a22b8997"},"schema_version":"1.0","source":{"id":"2301.06426","kind":"arxiv","version":2}},"canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","first_computed_at":"2026-07-05T05:59:06.028811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:59:06.028811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B9+jHjDDC3nfK3+jGstpUV1KK/q5ug/AEBjHbFClu3VMhBK/tSiEQgeiqrklwIFW98STzNOmrQqLK/YH0EdJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:59:06.029305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.06426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c83ac69dfdfc5ba2254f078d05be47ed690cb188cdb2d22b015aa2c560dde5","sha256:294798f814bc06570ff4874a1dfc87b39f2bc47c2167df3da9275a6e93a82b77"],"state_sha256":"be1b59ee27cac1485ab26e1145b6216807ed9fcb6c5ddcae0d85ad5ee20c95a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YU7rVS1E8hXIOTL5xIPK7raFaBV4JIjGbG1BwawjIAacTgyvp41q7DrAYMEWmhsnqjSMESfXPdZ9Eu2IUyVuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:18:05.241945Z","bundle_sha256":"08550fce4dc547fbb57d5556c41aeb2461790dbe262571b4dec071f332fd125e"}}