{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5YI3MMP6Q2S2GTGN3PUF5IFZXB","short_pith_number":"pith:5YI3MMP6","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"},"canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","source":{"kind":"arxiv","id":"2505.12323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12323","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12323v1","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12323","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"5YI3MMP6Q2S2","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"5YI3MMP6Q2S2GTGN","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"5YI3MMP6","created_at":"2026-07-05T11:05:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5YI3MMP6Q2S2GTGN3PUF5IFZXB","target":"record","payload":{"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"},"canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","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"},"source_kind":"arxiv","source_id":"2505.12323","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:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qu/MFrfpdhurh1rSNuGm4H+IG23Avk9/aTI0LgYI26wBF3fjZ9C7b8Y3hNN/BMdyvcp1QBwmMoGOoRtw7YsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:06:51.679638Z"},"content_sha256":"831e45b53a15ccd0b1c9204b9925d857c9d8e8ddbb3840f1f9c602e57321ecdb","schema_version":"1.0","event_id":"sha256:831e45b53a15ccd0b1c9204b9925d857c9d8e8ddbb3840f1f9c602e57321ecdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5YI3MMP6Q2S2GTGN3PUF5IFZXB","target":"graph","payload":{"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"},"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:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUl6ANjUherdWg79wDtGd/Yd6A8Z3AM+SMCwG6A2z7s2URJlVIEoPyXtPMXT2OhrCipR9+W1RmHLP/d7/pqDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:06:51.680148Z"},"content_sha256":"49d6d41e81c6ad614164ff38d343288b1ec25e6c58057e1309d5c38059b5bb75","schema_version":"1.0","event_id":"sha256:49d6d41e81c6ad614164ff38d343288b1ec25e6c58057e1309d5c38059b5bb75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/bundle.json","state_url":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/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-18T19:06:51Z","links":{"resolver":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB","bundle":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/bundle.json","state":"https://pith.science/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5YI3MMP6Q2S2GTGN3PUF5IFZXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5YI3MMP6Q2S2GTGN3PUF5IFZXB","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":"fd5b9576a18488ed640fe5b265f2bbe4b5818801675f3ca09942d5b7c6d3d8c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-18T09:33:10Z","title_canon_sha256":"fc4598e03299b9cf62b8b3336c4b5b5a7d8a1a2cc371dc4ba49eca484ba7bb24"},"schema_version":"1.0","source":{"id":"2505.12323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12323","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12323v1","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12323","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"5YI3MMP6Q2S2","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"5YI3MMP6Q2S2GTGN","created_at":"2026-07-05T11:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"5YI3MMP6","created_at":"2026-07-05T11:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:49d6d41e81c6ad614164ff38d343288b1ec25e6c58057e1309d5c38059b5bb75","target":"graph","created_at":"2026-07-05T11:05:02Z","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/2505.12323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jayadeva, Mohit Kataria, Nikita Malik, Sandeep Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-18T09:33:10Z","title":"GraphFLEx: Structure Learning Framework for Large Expanding Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12323","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:831e45b53a15ccd0b1c9204b9925d857c9d8e8ddbb3840f1f9c602e57321ecdb","target":"record","created_at":"2026-07-05T11:05:02Z","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":"fd5b9576a18488ed640fe5b265f2bbe4b5818801675f3ca09942d5b7c6d3d8c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-18T09:33:10Z","title_canon_sha256":"fc4598e03299b9cf62b8b3336c4b5b5a7d8a1a2cc371dc4ba49eca484ba7bb24"},"schema_version":"1.0","source":{"id":"2505.12323","kind":"arxiv","version":1}},"canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee11b631fe86a5a34ccddbe85ea0b9b872f0b2da7a1a92a43b727f427ee99aaf","first_computed_at":"2026-07-05T11:05:02.297840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:02.297840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p/lTpGWicNngiZjtaTv2LWcEZMvBVXSXKnInxX67Vud5BNngcMzgRkrZ9nxpXT+YBMBdvBky3ah2JuZJr2T+Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:02.298445Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:831e45b53a15ccd0b1c9204b9925d857c9d8e8ddbb3840f1f9c602e57321ecdb","sha256:49d6d41e81c6ad614164ff38d343288b1ec25e6c58057e1309d5c38059b5bb75"],"state_sha256":"e4490aec0fbaed50537e78c1cdb890f516a9e80052782fd4a735cb7388f41dc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrRZUETD/9J2wPCRYhDxSCvHn5o72e18w+AivuxmmYzuTkhZ82g6wJM8tQ/6nFMSAEc2iQGf7E3q4Yt7/6BWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:06:51.685293Z","bundle_sha256":"380153e45b16b33e332f699c0801a85e04305eb69a0e55a88af73eae7620c959"}}