{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IQ3DNSJSSGVZPOODSMDJRUEDWU","short_pith_number":"pith:IQ3DNSJS","canonical_record":{"source":{"id":"2409.01656","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-03T06:50:03Z","cross_cats_sorted":["cs.DM","cs.LG","math.CO"],"title_canon_sha256":"91a4b0901d6d4ec53d3a7f5cf003ae5a8beb3d6f451e4da3e6f34177abca7ed1","abstract_canon_sha256":"abc15f31695a84fdde6da6f2db2072e8794c10689738af560b0d5745c8fc4bb1"},"schema_version":"1.0"},"canonical_sha256":"443636c93291ab97b9c3930698d083b52bf7a7d1d80a320d0438de9153d7e687","source":{"kind":"arxiv","id":"2409.01656","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01656","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01656v3","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01656","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"IQ3DNSJSSGVZ","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_16","alias_value":"IQ3DNSJSSGVZPOOD","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_8","alias_value":"IQ3DNSJS","created_at":"2026-07-05T11:32:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IQ3DNSJSSGVZPOODSMDJRUEDWU","target":"record","payload":{"canonical_record":{"source":{"id":"2409.01656","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-03T06:50:03Z","cross_cats_sorted":["cs.DM","cs.LG","math.CO"],"title_canon_sha256":"91a4b0901d6d4ec53d3a7f5cf003ae5a8beb3d6f451e4da3e6f34177abca7ed1","abstract_canon_sha256":"abc15f31695a84fdde6da6f2db2072e8794c10689738af560b0d5745c8fc4bb1"},"schema_version":"1.0"},"canonical_sha256":"443636c93291ab97b9c3930698d083b52bf7a7d1d80a320d0438de9153d7e687","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:17.326442Z","signature_b64":"SWk2sh2I/tON9uUMTrOJe/t/aDM98COh8VmJnMVSieVRY5GndJNhNc46NZLCMrX42kH3dcqNkzXpMWm9wi2fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"443636c93291ab97b9c3930698d083b52bf7a7d1d80a320d0438de9153d7e687","last_reissued_at":"2026-07-05T11:32:17.325997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:17.325997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.01656","source_version":3,"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:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cTb96sz42Jt4cRTKY0IBDvPGHTgRWiGObmrAL4Jw/Kbz9AJxnHIvgHQGhAeRK3MdxiAyeSwPpElM8MRASzWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:13:06.708209Z"},"content_sha256":"0e5e93838d911944c6d3d82e90a90bd8e3f9bcb2b319d7e6bea6530445865b7c","schema_version":"1.0","event_id":"sha256:0e5e93838d911944c6d3d82e90a90bd8e3f9bcb2b319d7e6bea6530445865b7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IQ3DNSJSSGVZPOODSMDJRUEDWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphons of Line Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.LG","math.CO"],"primary_cat":"stat.ML","authors_text":"Cheng Soon Ong, Sevvandi Kandanaarachchi","submitted_at":"2024-09-03T06:50:03Z","abstract_excerpt":"We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves mapping the original graphs to their line graphs. We show that graphs satisfying a particular property, which we call the square-degree property are sparse, but give rise to dense line graphs. This enables the use of results on graph limits of dense graphs to derive convergence. In particular, star graphs satisfy the square-degree property resulting in dense line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01656","kind":"arxiv","version":3},"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/2409.01656/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:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWf3a01JylRsVuf8hRhzd9CT9GYQimDQPHbyfqPFYfVf7anM1evdeDwmR7fYGNl8p3mkzjChvkyk7E7VnijHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:13:06.708608Z"},"content_sha256":"20092f89f361f5592ed3544c6aacfe786e73b13fec3ddf2d89fe8ae02bc4c51d","schema_version":"1.0","event_id":"sha256:20092f89f361f5592ed3544c6aacfe786e73b13fec3ddf2d89fe8ae02bc4c51d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/bundle.json","state_url":"https://pith.science/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/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-04T05:13:06Z","links":{"resolver":"https://pith.science/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU","bundle":"https://pith.science/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/bundle.json","state":"https://pith.science/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQ3DNSJSSGVZPOODSMDJRUEDWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IQ3DNSJSSGVZPOODSMDJRUEDWU","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":"abc15f31695a84fdde6da6f2db2072e8794c10689738af560b0d5745c8fc4bb1","cross_cats_sorted":["cs.DM","cs.LG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-03T06:50:03Z","title_canon_sha256":"91a4b0901d6d4ec53d3a7f5cf003ae5a8beb3d6f451e4da3e6f34177abca7ed1"},"schema_version":"1.0","source":{"id":"2409.01656","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01656","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01656v3","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01656","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"IQ3DNSJSSGVZ","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_16","alias_value":"IQ3DNSJSSGVZPOOD","created_at":"2026-07-05T11:32:17Z"},{"alias_kind":"pith_short_8","alias_value":"IQ3DNSJS","created_at":"2026-07-05T11:32:17Z"}],"graph_snapshots":[{"event_id":"sha256:20092f89f361f5592ed3544c6aacfe786e73b13fec3ddf2d89fe8ae02bc4c51d","target":"graph","created_at":"2026-07-05T11:32:17Z","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/2409.01656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves mapping the original graphs to their line graphs. We show that graphs satisfying a particular property, which we call the square-degree property are sparse, but give rise to dense line graphs. This enables the use of results on graph limits of dense graphs to derive convergence. In particular, star graphs satisfy the square-degree property resulting in dense line","authors_text":"Cheng Soon Ong, Sevvandi Kandanaarachchi","cross_cats":["cs.DM","cs.LG","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-03T06:50:03Z","title":"Graphons of Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01656","kind":"arxiv","version":3},"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:0e5e93838d911944c6d3d82e90a90bd8e3f9bcb2b319d7e6bea6530445865b7c","target":"record","created_at":"2026-07-05T11:32:17Z","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":"abc15f31695a84fdde6da6f2db2072e8794c10689738af560b0d5745c8fc4bb1","cross_cats_sorted":["cs.DM","cs.LG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-03T06:50:03Z","title_canon_sha256":"91a4b0901d6d4ec53d3a7f5cf003ae5a8beb3d6f451e4da3e6f34177abca7ed1"},"schema_version":"1.0","source":{"id":"2409.01656","kind":"arxiv","version":3}},"canonical_sha256":"443636c93291ab97b9c3930698d083b52bf7a7d1d80a320d0438de9153d7e687","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"443636c93291ab97b9c3930698d083b52bf7a7d1d80a320d0438de9153d7e687","first_computed_at":"2026-07-05T11:32:17.325997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:17.325997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SWk2sh2I/tON9uUMTrOJe/t/aDM98COh8VmJnMVSieVRY5GndJNhNc46NZLCMrX42kH3dcqNkzXpMWm9wi2fCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:17.326442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.01656","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e5e93838d911944c6d3d82e90a90bd8e3f9bcb2b319d7e6bea6530445865b7c","sha256:20092f89f361f5592ed3544c6aacfe786e73b13fec3ddf2d89fe8ae02bc4c51d"],"state_sha256":"1bf06f5958f230904dc8391bfef6965a5c850b13db0d728f90f1a0c723357619"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmOWbel9VRBnP0Uced0njAX2L45QdSX0f86vtgMPySrBJCndH846eSwovb5EKr3k6bUpqLwlU+PO931V7pmuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:13:06.711375Z","bundle_sha256":"748f4ca7037bb077284efce4278e762d6f0ea37aaac3752c77a454f6e0bae725"}}