{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DX6WJJCG6KUKBERUK2XKC2OAZE","short_pith_number":"pith:DX6WJJCG","canonical_record":{"source":{"id":"1806.03436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-06-09T08:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"555cd8e9a4148c2fe2104d637048b2d345ea6fb524c7e80d24d6d356d0002e63","abstract_canon_sha256":"afd893543995464ddcec257c95bd3758ed1a8ca54d7bba80673a5a0016a84c3b"},"schema_version":"1.0"},"canonical_sha256":"1dfd64a446f2a8a0923456aea169c0c91c60675cba902aa531f4ea08a898e8f7","source":{"kind":"arxiv","id":"1806.03436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03436","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03436v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03436","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"DX6WJJCG6KUK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DX6WJJCG6KUKBERU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DX6WJJCG","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DX6WJJCG6KUKBERUK2XKC2OAZE","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-06-09T08:13:53Z","cross_cats_sorted":[],"title_canon_sha256":"555cd8e9a4148c2fe2104d637048b2d345ea6fb524c7e80d24d6d356d0002e63","abstract_canon_sha256":"afd893543995464ddcec257c95bd3758ed1a8ca54d7bba80673a5a0016a84c3b"},"schema_version":"1.0"},"canonical_sha256":"1dfd64a446f2a8a0923456aea169c0c91c60675cba902aa531f4ea08a898e8f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.405287Z","signature_b64":"YseejqG5XjDUQjzat/OwLlCfdVt6+cG5y+G+JXCslBUSdTYWq2TZYY53rFF30A2wPIrBVJ1aQxTj957ahSGdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dfd64a446f2a8a0923456aea169c0c91c60675cba902aa531f4ea08a898e8f7","last_reissued_at":"2026-05-18T00:13:43.404564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.404564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03436","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-05-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osRypGC20imG/4R7bk5UiuyNo2Lgk5AJWdNifr++b6Bjvj32/mTVcWSGRIVMLc433mpGgoO/xv+wBKb7qnWJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:48:24.009818Z"},"content_sha256":"c5a671a03d2f8d6c5e5b8c6a8395ca5bf424e8efbf360bbbaefce8e91713696c","schema_version":"1.0","event_id":"sha256:c5a671a03d2f8d6c5e5b8c6a8395ca5bf424e8efbf360bbbaefce8e91713696c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DX6WJJCG6KUKBERUK2XKC2OAZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\Gamma$-limit of the cut functional on dense graph sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AP","authors_text":"Andrea Braides, Paolo Cermelli, Simone Dovetta","submitted_at":"2018-06-09T08:13:53Z","abstract_excerpt":"A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information about the asymptotic behavior of the sequence. Here we show that the problem of subdividing a large graph in communities with a minimal amount of cuts can be approached in terms of graphons and the $\\Gamma$-limit of the cut functional, and discuss the resulting variational principles on some examples. Since the limit cut functional is naturally defined on Y"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03436","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":""},"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-05-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ad+8SehHapL9nZIotEBgPuSBwLGYAon0Jx/HFV4X/UJHvbYVhKDQtY40xbz4WjU1hFq1iZmPeynzp9vj8zeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:48:24.010516Z"},"content_sha256":"61c164b9c49f1805290e4d37eec7a1c7965033825984a5fbf02ea5d63de9610c","schema_version":"1.0","event_id":"sha256:61c164b9c49f1805290e4d37eec7a1c7965033825984a5fbf02ea5d63de9610c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/bundle.json","state_url":"https://pith.science/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/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-06-08T20:48:24Z","links":{"resolver":"https://pith.science/pith/DX6WJJCG6KUKBERUK2XKC2OAZE","bundle":"https://pith.science/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/bundle.json","state":"https://pith.science/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DX6WJJCG6KUKBERUK2XKC2OAZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DX6WJJCG6KUKBERUK2XKC2OAZE","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":"afd893543995464ddcec257c95bd3758ed1a8ca54d7bba80673a5a0016a84c3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-06-09T08:13:53Z","title_canon_sha256":"555cd8e9a4148c2fe2104d637048b2d345ea6fb524c7e80d24d6d356d0002e63"},"schema_version":"1.0","source":{"id":"1806.03436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03436","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03436v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03436","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"DX6WJJCG6KUK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DX6WJJCG6KUKBERU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DX6WJJCG","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:61c164b9c49f1805290e4d37eec7a1c7965033825984a5fbf02ea5d63de9610c","target":"graph","created_at":"2026-05-18T00:13:43Z","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"},"paper":{"abstract_excerpt":"A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information about the asymptotic behavior of the sequence. Here we show that the problem of subdividing a large graph in communities with a minimal amount of cuts can be approached in terms of graphons and the $\\Gamma$-limit of the cut functional, and discuss the resulting variational principles on some examples. Since the limit cut functional is naturally defined on Y","authors_text":"Andrea Braides, Paolo Cermelli, Simone Dovetta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-06-09T08:13:53Z","title":"$\\Gamma$-limit of the cut functional on dense graph sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03436","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:c5a671a03d2f8d6c5e5b8c6a8395ca5bf424e8efbf360bbbaefce8e91713696c","target":"record","created_at":"2026-05-18T00:13:43Z","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":"afd893543995464ddcec257c95bd3758ed1a8ca54d7bba80673a5a0016a84c3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AP","submitted_at":"2018-06-09T08:13:53Z","title_canon_sha256":"555cd8e9a4148c2fe2104d637048b2d345ea6fb524c7e80d24d6d356d0002e63"},"schema_version":"1.0","source":{"id":"1806.03436","kind":"arxiv","version":1}},"canonical_sha256":"1dfd64a446f2a8a0923456aea169c0c91c60675cba902aa531f4ea08a898e8f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dfd64a446f2a8a0923456aea169c0c91c60675cba902aa531f4ea08a898e8f7","first_computed_at":"2026-05-18T00:13:43.404564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.404564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YseejqG5XjDUQjzat/OwLlCfdVt6+cG5y+G+JXCslBUSdTYWq2TZYY53rFF30A2wPIrBVJ1aQxTj957ahSGdBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.405287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5a671a03d2f8d6c5e5b8c6a8395ca5bf424e8efbf360bbbaefce8e91713696c","sha256:61c164b9c49f1805290e4d37eec7a1c7965033825984a5fbf02ea5d63de9610c"],"state_sha256":"e907e6f04e094004370cb125d1469d357ea51e925fa2288e62d2bd9cf1487ae0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eb75pJSa7jzkEO4178whKCZmImkwjtp5EmK0WoS54mqyxP/lDz7ItgnMXm0rrUCjD5BUgAaxLb3Rtci7zkchAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:48:24.014188Z","bundle_sha256":"bbb7e2e35ba774cdb2d019d448f8ddb97d573165e50e1fb33e37398dfb3db916"}}