{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:36K6CPGY2BWR4VF25A7KBTN7SP","short_pith_number":"pith:36K6CPGY","schema_version":"1.0","canonical_sha256":"df95e13cd8d06d1e54bae83ea0cdbf93d49d11a9b11fff2a8e41aedb29f3e618","source":{"kind":"arxiv","id":"1404.2456","version":1},"attestation_state":"computed","paper":{"title":"On the Typical Structure of Graphs in a Monotone Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Svante Janson","submitted_at":"2014-04-09T12:14:11Z","abstract_excerpt":"Given a graph property $\\mathcal{P}$, it is interesting to determine the typical structure of graphs that satisfy $\\mathcal{P}$. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if $\\mathcal{P}$ is a monotone property and $r$ is the largest integer for which every $r$-colorable graph satisfies $\\mathcal{P}$, then almost every graph with $\\mathcal{P}$ is close to being a balanced $r$-partite graph."},"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":"1404.2456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-09T12:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"ed54742c2cc51e3c7d37a12817b27bc446447a7690b0cee2893f3cd89fbb749d","abstract_canon_sha256":"c549527723db62892de1240f061fda5cfd96c1eb1aa91e1e2ddca62edb28e670"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:31.468969Z","signature_b64":"TGYDnhr5L118qv0jMjLW0EBtfMxqFJeqAL8nWzIrNOKxYjqYTOfxhSZcljTyS9k0r1OHlWNaP/gDqanBpKbuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df95e13cd8d06d1e54bae83ea0cdbf93d49d11a9b11fff2a8e41aedb29f3e618","last_reissued_at":"2026-05-18T02:54:31.468392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:31.468392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Typical Structure of Graphs in a Monotone Property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew J. Uzzell, Svante Janson","submitted_at":"2014-04-09T12:14:11Z","abstract_excerpt":"Given a graph property $\\mathcal{P}$, it is interesting to determine the typical structure of graphs that satisfy $\\mathcal{P}$. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs. Using results from the theory of graph limits, we show that if $\\mathcal{P}$ is a monotone property and $r$ is the largest integer for which every $r$-colorable graph satisfies $\\mathcal{P}$, then almost every graph with $\\mathcal{P}$ is close to being a balanced $r$-partite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2456","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":"1404.2456","created_at":"2026-05-18T02:54:31.468493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2456v1","created_at":"2026-05-18T02:54:31.468493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2456","created_at":"2026-05-18T02:54:31.468493+00:00"},{"alias_kind":"pith_short_12","alias_value":"36K6CPGY2BWR","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"36K6CPGY2BWR4VF2","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"36K6CPGY","created_at":"2026-05-18T12:28:11.866339+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/36K6CPGY2BWR4VF25A7KBTN7SP","json":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP.json","graph_json":"https://pith.science/api/pith-number/36K6CPGY2BWR4VF25A7KBTN7SP/graph.json","events_json":"https://pith.science/api/pith-number/36K6CPGY2BWR4VF25A7KBTN7SP/events.json","paper":"https://pith.science/paper/36K6CPGY"},"agent_actions":{"view_html":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP","download_json":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP.json","view_paper":"https://pith.science/paper/36K6CPGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2456&json=true","fetch_graph":"https://pith.science/api/pith-number/36K6CPGY2BWR4VF25A7KBTN7SP/graph.json","fetch_events":"https://pith.science/api/pith-number/36K6CPGY2BWR4VF25A7KBTN7SP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP/action/storage_attestation","attest_author":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP/action/author_attestation","sign_citation":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP/action/citation_signature","submit_replication":"https://pith.science/pith/36K6CPGY2BWR4VF25A7KBTN7SP/action/replication_record"}},"created_at":"2026-05-18T02:54:31.468493+00:00","updated_at":"2026-05-18T02:54:31.468493+00:00"}