{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:T5C7RSAABLBCK5VHX7F5367VN2","short_pith_number":"pith:T5C7RSAA","schema_version":"1.0","canonical_sha256":"9f45f8c8000ac22576a7bfcbddfbf56e9cacc6167819c42939f5d8f1ab222066","source":{"kind":"arxiv","id":"1211.3106","version":2},"attestation_state":"computed","paper":{"title":"On the 3-local profiles of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Hao Huang, Humberto Naves, Nati Linial, Yuval Peled","submitted_at":"2012-11-13T20:48:36Z","abstract_excerpt":"For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\\cal S}_3 \\subset \\mathbb R^4$ of all vectors (p_0,...,p_3) that are arbitrarily close to the 3-local profiles of arbitrarily large graphs. We give a full description of the projection of ${\\cal S}_3$ to the (p_0, p_3) plane. The upper envelope of this planar domain is obtained from cliques on a fraction of the vertex set and complements of such graphs. The lower envelope is Goodman's inequality p_0+p_3\\"},"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":"1211.3106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-13T20:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"a61762fe1eed19878f20a6b9639a013d55f69a3d63425fc856a25c9221f1b963","abstract_canon_sha256":"ea62ba8e45f3978baead69868a38b172225ead7a3918689efaf6e800ace6abce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.775675Z","signature_b64":"sopj4MUUQ9lFgMyRZ2BqzaVqKoRXm7FCfdI46Aml+TcMUCzWNOlveCKrvXjxUsgy8QNfFnbAMSHue+xuhC/sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f45f8c8000ac22576a7bfcbddfbf56e9cacc6167819c42939f5d8f1ab222066","last_reissued_at":"2026-05-18T03:05:18.775081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.775081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the 3-local profiles of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Hao Huang, Humberto Naves, Nati Linial, Yuval Peled","submitted_at":"2012-11-13T20:48:36Z","abstract_excerpt":"For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges. We call (p_0(G),...,p_3(G)) the 3-local profile of G. We investigate the set ${\\cal S}_3 \\subset \\mathbb R^4$ of all vectors (p_0,...,p_3) that are arbitrarily close to the 3-local profiles of arbitrarily large graphs. We give a full description of the projection of ${\\cal S}_3$ to the (p_0, p_3) plane. The upper envelope of this planar domain is obtained from cliques on a fraction of the vertex set and complements of such graphs. The lower envelope is Goodman's inequality p_0+p_3\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3106","kind":"arxiv","version":2},"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":"1211.3106","created_at":"2026-05-18T03:05:18.775139+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3106v2","created_at":"2026-05-18T03:05:18.775139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3106","created_at":"2026-05-18T03:05:18.775139+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5C7RSAABLBC","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5C7RSAABLBCK5VH","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5C7RSAA","created_at":"2026-05-18T12:27:23.164592+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/T5C7RSAABLBCK5VHX7F5367VN2","json":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2.json","graph_json":"https://pith.science/api/pith-number/T5C7RSAABLBCK5VHX7F5367VN2/graph.json","events_json":"https://pith.science/api/pith-number/T5C7RSAABLBCK5VHX7F5367VN2/events.json","paper":"https://pith.science/paper/T5C7RSAA"},"agent_actions":{"view_html":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2","download_json":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2.json","view_paper":"https://pith.science/paper/T5C7RSAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3106&json=true","fetch_graph":"https://pith.science/api/pith-number/T5C7RSAABLBCK5VHX7F5367VN2/graph.json","fetch_events":"https://pith.science/api/pith-number/T5C7RSAABLBCK5VHX7F5367VN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2/action/storage_attestation","attest_author":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2/action/author_attestation","sign_citation":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2/action/citation_signature","submit_replication":"https://pith.science/pith/T5C7RSAABLBCK5VHX7F5367VN2/action/replication_record"}},"created_at":"2026-05-18T03:05:18.775139+00:00","updated_at":"2026-05-18T03:05:18.775139+00:00"}