{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5YI3MMP6Q2S2GTGN3PUF5IFZXB","short_pith_number":"pith:5YI3MMP6","schema_version":"1.0","canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","source":{"kind":"arxiv","id":"2505.12323","version":1},"attestation_state":"computed","paper":{"title":"GraphFLEx: Structure Learning Framework for Large Expanding Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jayadeva, Mohit Kataria, Nikita Malik, Sandeep Kumar","submitted_at":"2025-05-18T09:33:10Z","abstract_excerpt":"Graph structure learning is a core problem in graph-based machine learning, essential for uncovering latent relationships and ensuring model interpretability. However, most existing approaches are ill-suited for large-scale and dynamically evolving graphs, as they often require complete re-learning of the structure upon the arrival of new nodes and incur substantial computational and memory costs. In this work, we propose GraphFLEx: a unified and scalable framework for Graph Structure Learning in Large and Expanding Graphs. GraphFLEx mitigates the scalability bottlenecks by restricting edge fo"},"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.12323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-18T09:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"fc4598e03299b9cf62b8b3336c4b5b5a7d8a1a2cc371dc4ba49eca484ba7bb24","abstract_canon_sha256":"fd5b9576a18488ed640fe5b265f2bbe4b5818801675f3ca09942d5b7c6d3d8c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:02.298445Z","signature_b64":"p/lTpGWicNngiZjtaTv2LWcEZMvBVXSXKnInxX67Vud5BNngcMzgRkrZ9nxpXT+YBMBdvBky3ah2JuZJr2T+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","last_reissued_at":"2026-07-05T11:05:02.297840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:02.297840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphFLEx: Structure Learning Framework for Large Expanding Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jayadeva, Mohit Kataria, Nikita Malik, Sandeep Kumar","submitted_at":"2025-05-18T09:33:10Z","abstract_excerpt":"Graph structure learning is a core problem in graph-based machine learning, essential for uncovering latent relationships and ensuring model interpretability. However, most existing approaches are ill-suited for large-scale and dynamically evolving graphs, as they often require complete re-learning of the structure upon the arrival of new nodes and incur substantial computational and memory costs. In this work, we propose GraphFLEx: a unified and scalable framework for Graph Structure Learning in Large and Expanding Graphs. GraphFLEx mitigates the scalability bottlenecks by restricting edge fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12323","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.12323/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.12323","created_at":"2026-07-05T11:05:02.297916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.12323v1","created_at":"2026-07-05T11:05:02.297916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12323","created_at":"2026-07-05T11:05:02.297916+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YI3MMP6Q2S2","created_at":"2026-07-05T11:05:02.297916+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YI3MMP6Q2S2GTGN","created_at":"2026-07-05T11:05:02.297916+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YI3MMP6","created_at":"2026-07-05T11:05:02.297916+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/5YI3MMP6Q2S2GTGN3PUF5IFZXB","json":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB.json","graph_json":"https://pith.science/api/pith-number/5YI3MMP6Q2S2GTGN3PUF5IFZXB/graph.json","events_json":"https://pith.science/api/pith-number/5YI3MMP6Q2S2GTGN3PUF5IFZXB/events.json","paper":"https://pith.science/paper/5YI3MMP6"},"agent_actions":{"view_html":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB","download_json":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB.json","view_paper":"https://pith.science/paper/5YI3MMP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.12323&json=true","fetch_graph":"https://pith.science/api/pith-number/5YI3MMP6Q2S2GTGN3PUF5IFZXB/graph.json","fetch_events":"https://pith.science/api/pith-number/5YI3MMP6Q2S2GTGN3PUF5IFZXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/action/storage_attestation","attest_author":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/action/author_attestation","sign_citation":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/action/citation_signature","submit_replication":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/action/replication_record"}},"created_at":"2026-07-05T11:05:02.297916+00:00","updated_at":"2026-07-05T11:05:02.297916+00:00"}