{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AKKRK73PEN26AYCUTP7SRAUMCE","short_pith_number":"pith:AKKRK73P","schema_version":"1.0","canonical_sha256":"0295157f6f2375e060549bff28828c110c0d82cdcf455e538aa948fe4671757f","source":{"kind":"arxiv","id":"2301.06426","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2301.06426","created_at":"2026-07-05T05:59:06.028867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.06426v2","created_at":"2026-07-05T05:59:06.028867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.06426","created_at":"2026-07-05T05:59:06.028867+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKKRK73PEN26","created_at":"2026-07-05T05:59:06.028867+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKKRK73PEN26AYCU","created_at":"2026-07-05T05:59:06.028867+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKKRK73P","created_at":"2026-07-05T05:59:06.028867+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/AKKRK73PEN26AYCUTP7SRAUMCE","json":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE.json","graph_json":"https://pith.science/api/pith-number/AKKRK73PEN26AYCUTP7SRAUMCE/graph.json","events_json":"https://pith.science/api/pith-number/AKKRK73PEN26AYCUTP7SRAUMCE/events.json","paper":"https://pith.science/paper/AKKRK73P"},"agent_actions":{"view_html":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE","download_json":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE.json","view_paper":"https://pith.science/paper/AKKRK73P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.06426&json=true","fetch_graph":"https://pith.science/api/pith-number/AKKRK73PEN26AYCUTP7SRAUMCE/graph.json","fetch_events":"https://pith.science/api/pith-number/AKKRK73PEN26AYCUTP7SRAUMCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/action/storage_attestation","attest_author":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/action/author_attestation","sign_citation":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/action/citation_signature","submit_replication":"https://pith.science/pith/AKKRK73PEN26AYCUTP7SRAUMCE/action/replication_record"}},"created_at":"2026-07-05T05:59:06.028867+00:00","updated_at":"2026-07-05T05:59:06.028867+00:00"}