{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LJZH3MG3ESGDXDEEJVRN6DWBFC","short_pith_number":"pith:LJZH3MG3","schema_version":"1.0","canonical_sha256":"5a727db0db248c3b8c844d62df0ec1288a3517eacc1b8600ebc8fad4bc053449","source":{"kind":"arxiv","id":"1509.08585","version":1},"attestation_state":"computed","paper":{"title":"An Independent Process Approximation to Sparse Random Graphs with a Prescribed Number of Edges and Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"M. Puck Rombach, Stephen DeSalvo","submitted_at":"2015-09-29T04:09:54Z","abstract_excerpt":"We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not involved in a triangle independently and uniformly over all possibilities, and the other is the uniform distribution over simple graphs with exactly $k_T$ triangles and $k_S$ edges not involved in a triangle. As a corollary, for $k_S = o(n)$ and $k_T = o(n)$ as $n$ tends to infinity, the total variation distance tends to $0$, at a rate that is given explicitly. "},"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":"1509.08585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-29T04:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"fb22fa7cb67e9a3913d925c815c123a33b4cc56192256cc7942e92bae4c1f64e","abstract_canon_sha256":"983adef39811cfbcaa70bb511810661b9d9a01b361d669031652dc930b656fdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:47.572738Z","signature_b64":"s46/g4gOgR/WpEtIQ7JsAYNzsTZf4YpnBAnNLHKPLbFHC/cLETvA0cMBlEQ8xe/bF/esMlMnukWrrl0yJYpcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a727db0db248c3b8c844d62df0ec1288a3517eacc1b8600ebc8fad4bc053449","last_reissued_at":"2026-05-18T01:31:47.572258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:47.572258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Independent Process Approximation to Sparse Random Graphs with a Prescribed Number of Edges and Triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"M. Puck Rombach, Stephen DeSalvo","submitted_at":"2015-09-29T04:09:54Z","abstract_excerpt":"We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not involved in a triangle independently and uniformly over all possibilities, and the other is the uniform distribution over simple graphs with exactly $k_T$ triangles and $k_S$ edges not involved in a triangle. As a corollary, for $k_S = o(n)$ and $k_T = o(n)$ as $n$ tends to infinity, the total variation distance tends to $0$, at a rate that is given explicitly. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08585","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.08585","created_at":"2026-05-18T01:31:47.572337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08585v1","created_at":"2026-05-18T01:31:47.572337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08585","created_at":"2026-05-18T01:31:47.572337+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJZH3MG3ESGD","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJZH3MG3ESGDXDEE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJZH3MG3","created_at":"2026-05-18T12:29:29.992203+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/LJZH3MG3ESGDXDEEJVRN6DWBFC","json":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC.json","graph_json":"https://pith.science/api/pith-number/LJZH3MG3ESGDXDEEJVRN6DWBFC/graph.json","events_json":"https://pith.science/api/pith-number/LJZH3MG3ESGDXDEEJVRN6DWBFC/events.json","paper":"https://pith.science/paper/LJZH3MG3"},"agent_actions":{"view_html":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC","download_json":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC.json","view_paper":"https://pith.science/paper/LJZH3MG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08585&json=true","fetch_graph":"https://pith.science/api/pith-number/LJZH3MG3ESGDXDEEJVRN6DWBFC/graph.json","fetch_events":"https://pith.science/api/pith-number/LJZH3MG3ESGDXDEEJVRN6DWBFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC/action/storage_attestation","attest_author":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC/action/author_attestation","sign_citation":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC/action/citation_signature","submit_replication":"https://pith.science/pith/LJZH3MG3ESGDXDEEJVRN6DWBFC/action/replication_record"}},"created_at":"2026-05-18T01:31:47.572337+00:00","updated_at":"2026-05-18T01:31:47.572337+00:00"}