{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VLTCSEGF4KP5NQLZIAX47QN4OT","short_pith_number":"pith:VLTCSEGF","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"},"canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","source":{"kind":"arxiv","id":"1405.6808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6808","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6808v1","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6808","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"VLTCSEGF4KP5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VLTCSEGF4KP5NQLZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VLTCSEGF","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VLTCSEGF4KP5NQLZIAX47QN4OT","target":"record","payload":{"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"},"canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","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"},"source_kind":"arxiv","source_id":"1405.6808","source_version":1,"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-05-18T02:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CSnHR7hqeklzPY6F31glSD2P028lxdGkVs3Gr0ZFQgMVbNmrGHUaH4/FNzS8A7+hWGkWSw+ZWlc9nPFuVCiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:56.849851Z"},"content_sha256":"f13d8e1172d2daaf30ae51d782dab8a1a3f27dd5d2fde2b92ced2e4ea57ce381","schema_version":"1.0","event_id":"sha256:f13d8e1172d2daaf30ae51d782dab8a1a3f27dd5d2fde2b92ced2e4ea57ce381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VLTCSEGF4KP5NQLZIAX47QN4OT","target":"graph","payload":{"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"},"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-05-18T02:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HhPBZOe0h3Gg95kGJpOmJPxAmjcqC3K5zxj6Wtd1Ygbx8+Ofo0fhApDObfGfCJsCu1x3b5lJ1lqNl+3oDZ/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:00:56.850588Z"},"content_sha256":"fcfa72a41c2dddf5830ff14a8004bd222339bdbb9185928afbc8640bf92a998c","schema_version":"1.0","event_id":"sha256:fcfa72a41c2dddf5830ff14a8004bd222339bdbb9185928afbc8640bf92a998c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/bundle.json","state_url":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/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-05-25T11:00:56Z","links":{"resolver":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT","bundle":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/bundle.json","state":"https://pith.science/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLTCSEGF4KP5NQLZIAX47QN4OT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VLTCSEGF4KP5NQLZIAX47QN4OT","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":"1196373ba4c4ad6a3b4586435d35dbad95d53a3d22af9a1d38b4400f8e750597","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T06:40:10Z","title_canon_sha256":"3c755ba74b90dde14ff64907d28ca3bd6a267e0be87ad1459ba7db77f8ceeb09"},"schema_version":"1.0","source":{"id":"1405.6808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6808","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6808v1","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6808","created_at":"2026-05-18T02:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"VLTCSEGF4KP5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VLTCSEGF4KP5NQLZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VLTCSEGF","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:fcfa72a41c2dddf5830ff14a8004bd222339bdbb9185928afbc8640bf92a998c","target":"graph","created_at":"2026-05-18T02:51:00Z","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"},"paper":{"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","authors_text":"Svante Janson, Vera T. S\\'os","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T06:40:10Z","title":"More on quasi-random graphs, subgraph counts and graph limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6808","kind":"arxiv","version":1},"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:f13d8e1172d2daaf30ae51d782dab8a1a3f27dd5d2fde2b92ced2e4ea57ce381","target":"record","created_at":"2026-05-18T02:51:00Z","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":"1196373ba4c4ad6a3b4586435d35dbad95d53a3d22af9a1d38b4400f8e750597","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-27T06:40:10Z","title_canon_sha256":"3c755ba74b90dde14ff64907d28ca3bd6a267e0be87ad1459ba7db77f8ceeb09"},"schema_version":"1.0","source":{"id":"1405.6808","kind":"arxiv","version":1}},"canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae62910c5e29fd6c179402fcfc1bc74d08d3c777c1d7c13473be9f09ad93216","first_computed_at":"2026-05-18T02:51:00.298269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:00.298269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0skdvcFSp7brjk2JjPbBuQfgJtyxCWhj2qs66iG57OoEz6Fgyahj28/v5L4a3edNOIcHokPkyThNg393SvfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:00.298726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f13d8e1172d2daaf30ae51d782dab8a1a3f27dd5d2fde2b92ced2e4ea57ce381","sha256:fcfa72a41c2dddf5830ff14a8004bd222339bdbb9185928afbc8640bf92a998c"],"state_sha256":"091e895486ba2323ed9004f98a5ee9a735f8162fbe0133d71d2c57aa096eb47a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuyijMNVcCSKP95EnowCpgkz9dSiZx+CSX6XGU5GxPYiSOEGFLF6UIswDoUzAnIVwiL1yA2C3UyTfR3xFE07CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:00:56.854142Z","bundle_sha256":"ff99cf6626c44d43016009a9f4d9fa5779b109dea875c90fc1173e826a50785b"}}