{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBREVARC3TKY6AD3NMHH7IINID","short_pith_number":"pith:SBREVARC","canonical_record":{"source":{"id":"1802.03652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T21:43:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d970c0981e499829264e891ed42d1935be80659876ec67ab47b7bda4adc44058","abstract_canon_sha256":"3d585682b106b058fdd1f6181d4e85ed2d272d64add2d3fadee353774d8b5823"},"schema_version":"1.0"},"canonical_sha256":"90624a8222dcd58f007b6b0e7fa10d40f3fad7592b6d47b7ddbfe85d4436eef1","source":{"kind":"arxiv","id":"1802.03652","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03652","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03652v3","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03652","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"SBREVARC3TKY","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_16","alias_value":"SBREVARC3TKY6AD3","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_8","alias_value":"SBREVARC","created_at":"2026-07-05T03:53:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBREVARC3TKY6AD3NMHH7IINID","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T21:43:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d970c0981e499829264e891ed42d1935be80659876ec67ab47b7bda4adc44058","abstract_canon_sha256":"3d585682b106b058fdd1f6181d4e85ed2d272d64add2d3fadee353774d8b5823"},"schema_version":"1.0"},"canonical_sha256":"90624a8222dcd58f007b6b0e7fa10d40f3fad7592b6d47b7ddbfe85d4436eef1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:53:58.308760Z","signature_b64":"0/RClSWc62XHpe37PFMliqc5T6xG/0dkosFm8U7zX/fuTAmrr9IqUJhgFH606B2Gh2f82qPNogqAaaZaY+npDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90624a8222dcd58f007b6b0e7fa10d40f3fad7592b6d47b7ddbfe85d4436eef1","last_reissued_at":"2026-07-05T03:53:58.308364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:53:58.308364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03652","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-05T03:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66P4T/KVYKxnLpQvqtEig5fHTmpgzw3hYye/9fhCYbv6pq5pO14zPDvRLq7a7jtigKupQno0LGhE1CDk/a8pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:12:04.746040Z"},"content_sha256":"27464c07cce0a3913cde593eae9cad2c045fe0c64d68ad42a6d3bf6f12c88daa","schema_version":"1.0","event_id":"sha256:27464c07cce0a3913cde593eae9cad2c045fe0c64d68ad42a6d3bf6f12c88daa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBREVARC3TKY6AD3NMHH7IINID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Sparse Graphs: The Random Overlapping Communities Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Samantha Petti, Santosh S. Vempala","submitted_at":"2018-02-10T21:43:13Z","abstract_excerpt":"How can we approximate sparse graphs and sequences of sparse graphs (with unbounded average degree)? We consider convergence in the first $k$ moments of the graph spectrum (equivalent to the numbers of closed $k$-walks) appropriately normalized. We introduce a simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence of hypercube graphs. The Random Overlapping Communities (ROC) model is specified by a distribution on pairs $(s,q)$, $s \\in \\mathbb{Z}_+, q \\in (0,1]$. A graph on $n$ vertices with average degree $d$ is gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03652","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/1802.03652/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-05T03:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlZ/8LwmN6fQz4bHIP7Zg/i9cDWK/0d9RhEPyPYP8dxWeQOJIeqxBIDHTmrbd761gLSOVNDrCU/wZTY3yWN1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T13:12:04.746726Z"},"content_sha256":"3debbbccda739c7096320ea73c26b88b5c5ffe772d2b7b42efd44744634a6a63","schema_version":"1.0","event_id":"sha256:3debbbccda739c7096320ea73c26b88b5c5ffe772d2b7b42efd44744634a6a63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBREVARC3TKY6AD3NMHH7IINID/bundle.json","state_url":"https://pith.science/pith/SBREVARC3TKY6AD3NMHH7IINID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBREVARC3TKY6AD3NMHH7IINID/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-07-05T13:12:04Z","links":{"resolver":"https://pith.science/pith/SBREVARC3TKY6AD3NMHH7IINID","bundle":"https://pith.science/pith/SBREVARC3TKY6AD3NMHH7IINID/bundle.json","state":"https://pith.science/pith/SBREVARC3TKY6AD3NMHH7IINID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBREVARC3TKY6AD3NMHH7IINID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBREVARC3TKY6AD3NMHH7IINID","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":"3d585682b106b058fdd1f6181d4e85ed2d272d64add2d3fadee353774d8b5823","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T21:43:13Z","title_canon_sha256":"d970c0981e499829264e891ed42d1935be80659876ec67ab47b7bda4adc44058"},"schema_version":"1.0","source":{"id":"1802.03652","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03652","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03652v3","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03652","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"SBREVARC3TKY","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_16","alias_value":"SBREVARC3TKY6AD3","created_at":"2026-07-05T03:53:58Z"},{"alias_kind":"pith_short_8","alias_value":"SBREVARC","created_at":"2026-07-05T03:53:58Z"}],"graph_snapshots":[{"event_id":"sha256:3debbbccda739c7096320ea73c26b88b5c5ffe772d2b7b42efd44744634a6a63","target":"graph","created_at":"2026-07-05T03:53:58Z","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/1802.03652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How can we approximate sparse graphs and sequences of sparse graphs (with unbounded average degree)? We consider convergence in the first $k$ moments of the graph spectrum (equivalent to the numbers of closed $k$-walks) appropriately normalized. We introduce a simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence of hypercube graphs. The Random Overlapping Communities (ROC) model is specified by a distribution on pairs $(s,q)$, $s \\in \\mathbb{Z}_+, q \\in (0,1]$. A graph on $n$ vertices with average degree $d$ is gene","authors_text":"Samantha Petti, Santosh S. Vempala","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T21:43:13Z","title":"Approximating Sparse Graphs: The Random Overlapping Communities Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03652","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:27464c07cce0a3913cde593eae9cad2c045fe0c64d68ad42a6d3bf6f12c88daa","target":"record","created_at":"2026-07-05T03:53:58Z","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":"3d585682b106b058fdd1f6181d4e85ed2d272d64add2d3fadee353774d8b5823","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-10T21:43:13Z","title_canon_sha256":"d970c0981e499829264e891ed42d1935be80659876ec67ab47b7bda4adc44058"},"schema_version":"1.0","source":{"id":"1802.03652","kind":"arxiv","version":3}},"canonical_sha256":"90624a8222dcd58f007b6b0e7fa10d40f3fad7592b6d47b7ddbfe85d4436eef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90624a8222dcd58f007b6b0e7fa10d40f3fad7592b6d47b7ddbfe85d4436eef1","first_computed_at":"2026-07-05T03:53:58.308364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:53:58.308364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/RClSWc62XHpe37PFMliqc5T6xG/0dkosFm8U7zX/fuTAmrr9IqUJhgFH606B2Gh2f82qPNogqAaaZaY+npDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:53:58.308760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03652","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27464c07cce0a3913cde593eae9cad2c045fe0c64d68ad42a6d3bf6f12c88daa","sha256:3debbbccda739c7096320ea73c26b88b5c5ffe772d2b7b42efd44744634a6a63"],"state_sha256":"b4d10d381699e16066a192e01bf31f4aa39e2b62b36abeae268c0df1031b0f2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FenPqX3LHejUgrVpSvFiVg4JJVDmjCSpSA56AxWXfEavdbQEhZGJ2HK7Q0nYHNAtEdFVCL7sWkHfaSbZQPhoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T13:12:04.750177Z","bundle_sha256":"11d9a6f514cb5ab3f6d573c7a7cc7a7fe0803459b1538f54de332afa8af149ce"}}