{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VLTCSEGF4KP5NQLZIAX47QN4OT","short_pith_number":"pith:VLTCSEGF","schema_version":"1.0","canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","source":{"kind":"arxiv","id":"1405.6808","version":1},"attestation_state":"computed","paper":{"title":"More on quasi-random graphs, subgraph counts and graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Svante Janson, Vera T. S\\'os","submitted_at":"2014-05-27T06:40:10Z","abstract_excerpt":"We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investigate some new properties of this type. We show that these properties too are quasi-random, at least in some cases; however, there are also cases that are left as open problems, and we discuss why the proo"},"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":"1405.6808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T06:40:10Z","cross_cats_sorted":[],"title_canon_sha256":"3c755ba74b90dde14ff64907d28ca3bd6a267e0be87ad1459ba7db77f8ceeb09","abstract_canon_sha256":"1196373ba4c4ad6a3b4586435d35dbad95d53a3d22af9a1d38b4400f8e750597"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:00.298726Z","signature_b64":"j0skdvcFSp7brjk2JjPbBuQfgJtyxCWhj2qs66iG57OoEz6Fgyahj28/v5L4a3edNOIcHokPkyThNg393SvfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","last_reissued_at":"2026-05-18T02:51:00.298269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:00.298269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More on quasi-random graphs, subgraph counts and graph limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Svante Janson, Vera T. S\\'os","submitted_at":"2014-05-27T06:40:10Z","abstract_excerpt":"We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investigate some new properties of this type. We show that these properties too are quasi-random, at least in some cases; however, there are also cases that are left as open problems, and we discuss why the proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6808","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":"1405.6808","created_at":"2026-05-18T02:51:00.298341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6808v1","created_at":"2026-05-18T02:51:00.298341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6808","created_at":"2026-05-18T02:51:00.298341+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLTCSEGF4KP5","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLTCSEGF4KP5NQLZ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLTCSEGF","created_at":"2026-05-18T12:28:54.890064+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/VLTCSEGF4KP5NQLZIAX47QN4OT","json":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT.json","graph_json":"https://pith.science/api/pith-number/VLTCSEGF4KP5NQLZIAX47QN4OT/graph.json","events_json":"https://pith.science/api/pith-number/VLTCSEGF4KP5NQLZIAX47QN4OT/events.json","paper":"https://pith.science/paper/VLTCSEGF"},"agent_actions":{"view_html":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT","download_json":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT.json","view_paper":"https://pith.science/paper/VLTCSEGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6808&json=true","fetch_graph":"https://pith.science/api/pith-number/VLTCSEGF4KP5NQLZIAX47QN4OT/graph.json","fetch_events":"https://pith.science/api/pith-number/VLTCSEGF4KP5NQLZIAX47QN4OT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/action/storage_attestation","attest_author":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/action/author_attestation","sign_citation":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/action/citation_signature","submit_replication":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/action/replication_record"}},"created_at":"2026-05-18T02:51:00.298341+00:00","updated_at":"2026-05-18T02:51:00.298341+00:00"}