{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I3NRWK4UP4PJUWGGUH72J6ZDDA","short_pith_number":"pith:I3NRWK4U","schema_version":"1.0","canonical_sha256":"46db1b2b947f1e9a58c6a1ffa4fb2318206db64304cc2be8866e3366fbe8e91c","source":{"kind":"arxiv","id":"2505.15842","version":1},"attestation_state":"computed","paper":{"title":"AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jayadeva, Mohit Kataria, Sandeep Kumar, Shreyash Bhilwade","submitted_at":"2025-05-18T09:57:33Z","abstract_excerpt":"$\\textbf{Graph Coarsening (GC)}$ is a prominent graph reduction technique that compresses large graphs to enable efficient learning and inference. However, existing GC methods generate only one coarsened graph per run and must recompute from scratch for each new coarsening ratio, resulting in unnecessary overhead. Moreover, most prior approaches are tailored to $\\textit{homogeneous}$ graphs and fail to accommodate the semantic constraints of $\\textit{heterogeneous}$ graphs, which comprise multiple node and edge types. To overcome these limitations, we introduce a novel framework that combines "},"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":"2505.15842","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-05-18T09:57:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cae3b498c67ca6e0258f682f0846aa06c135e2e4e5b0b1caf169d5c03ce73be8","abstract_canon_sha256":"36f517994762445d515cb0480299c18fd1c16e8406c5a49d03e269be66db8163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:07:26.126474Z","signature_b64":"7mnlQZ2vuzRtfvizf0NyIAhtVE5al/UhGqQBXvvPmVEtqyuck0WvCV2O7rxzQqZ8tzsZcPXpcLrsQU1g+SugCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46db1b2b947f1e9a58c6a1ffa4fb2318206db64304cc2be8866e3366fbe8e91c","last_reissued_at":"2026-07-05T11:07:26.125962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:07:26.125962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AH-UGC: Adaptive and Heterogeneous-Universal Graph Coarsening","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jayadeva, Mohit Kataria, Sandeep Kumar, Shreyash Bhilwade","submitted_at":"2025-05-18T09:57:33Z","abstract_excerpt":"$\\textbf{Graph Coarsening (GC)}$ is a prominent graph reduction technique that compresses large graphs to enable efficient learning and inference. However, existing GC methods generate only one coarsened graph per run and must recompute from scratch for each new coarsening ratio, resulting in unnecessary overhead. Moreover, most prior approaches are tailored to $\\textit{homogeneous}$ graphs and fail to accommodate the semantic constraints of $\\textit{heterogeneous}$ graphs, which comprise multiple node and edge types. To overcome these limitations, we introduce a novel framework that combines "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15842","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/2505.15842/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":"2505.15842","created_at":"2026-07-05T11:07:26.126019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15842v1","created_at":"2026-07-05T11:07:26.126019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15842","created_at":"2026-07-05T11:07:26.126019+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3NRWK4UP4PJ","created_at":"2026-07-05T11:07:26.126019+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3NRWK4UP4PJUWGG","created_at":"2026-07-05T11:07:26.126019+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3NRWK4U","created_at":"2026-07-05T11:07:26.126019+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13021","citing_title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA","json":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA.json","graph_json":"https://pith.science/api/pith-number/I3NRWK4UP4PJUWGGUH72J6ZDDA/graph.json","events_json":"https://pith.science/api/pith-number/I3NRWK4UP4PJUWGGUH72J6ZDDA/events.json","paper":"https://pith.science/paper/I3NRWK4U"},"agent_actions":{"view_html":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA","download_json":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA.json","view_paper":"https://pith.science/paper/I3NRWK4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15842&json=true","fetch_graph":"https://pith.science/api/pith-number/I3NRWK4UP4PJUWGGUH72J6ZDDA/graph.json","fetch_events":"https://pith.science/api/pith-number/I3NRWK4UP4PJUWGGUH72J6ZDDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA/action/storage_attestation","attest_author":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA/action/author_attestation","sign_citation":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA/action/citation_signature","submit_replication":"https://pith.science/pith/I3NRWK4UP4PJUWGGUH72J6ZDDA/action/replication_record"}},"created_at":"2026-07-05T11:07:26.126019+00:00","updated_at":"2026-07-05T11:07:26.126019+00:00"}