{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OWMVKCVWCN7R3RAYTFVMQB4ROX","short_pith_number":"pith:OWMVKCVW","canonical_record":{"source":{"id":"1803.10160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T16:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"871b3c9fe7a7def6345b859515c187fab6a3e6641b2a3c5345fd7dc378b3bc48","abstract_canon_sha256":"984abd0f27f9b5514e7f784ca7339dd4980e013abc8bba7e65f021eb6bfa3ff6"},"schema_version":"1.0"},"canonical_sha256":"7599550ab6137f1dc418996ac8079175d54b8752f867d7e37fb615bb14e406e5","source":{"kind":"arxiv","id":"1803.10160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10160","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10160v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10160","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"OWMVKCVWCN7R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OWMVKCVWCN7R3RAY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OWMVKCVW","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OWMVKCVWCN7R3RAYTFVMQB4ROX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T16:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"871b3c9fe7a7def6345b859515c187fab6a3e6641b2a3c5345fd7dc378b3bc48","abstract_canon_sha256":"984abd0f27f9b5514e7f784ca7339dd4980e013abc8bba7e65f021eb6bfa3ff6"},"schema_version":"1.0"},"canonical_sha256":"7599550ab6137f1dc418996ac8079175d54b8752f867d7e37fb615bb14e406e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.217081Z","signature_b64":"RlJaFjQVX7U74W3nq8r9s3du4YX4rER/LwDO/Se8aYvOfCX/M/cAB8UykcJyEw60Kw7rfk+JRuXNCM3dV8nMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7599550ab6137f1dc418996ac8079175d54b8752f867d7e37fb615bb14e406e5","last_reissued_at":"2026-05-18T00:20:00.216468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.216468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10160","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-18T00:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nlBFxrZQqsJohlzsCFB3Nc329Y+pNXGdLLpdwilTm4qr72YYO8rKYQ6NBaftItte0cG5Kqk4cCXYLCVNrGjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:28:23.371626Z"},"content_sha256":"9442f4876aadc8b62fcb6e6b288a3b09c8b2ca4eb380ce3d705fd40e99aa5213","schema_version":"1.0","event_id":"sha256:9442f4876aadc8b62fcb6e6b288a3b09c8b2ca4eb380ce3d705fd40e99aa5213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OWMVKCVWCN7R3RAYTFVMQB4ROX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Ramsey theorem for biased graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Peter Nelson, Sophia Park","submitted_at":"2018-03-27T16:10:55Z","abstract_excerpt":"A $biased\\ graph$ is a pair $(G,\\mathcal{B})$, where $G$ is a graph and $\\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type theorem, showing that if $(G,\\mathcal{B})$ is a biased graph which $G$ is a very large complete graph, then $G$ contains a large complete subgraph $H$ such that the set of balanced cycles within $H$ has one of three specific, highly symmetric structures, all of which can be described naturally via group-labellings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10160","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-18T00:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZAUYSDwhyvNgqzCohLqu3c+53JR3jmbEdhpthglBEODypnHxCr6CSUNurSk0S6v6iDt90KfAH9GDqYkMHfQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:28:23.371976Z"},"content_sha256":"41eacad63cfa502bd8c708144290deb5ca16bd80ef730ad947925cc0be852208","schema_version":"1.0","event_id":"sha256:41eacad63cfa502bd8c708144290deb5ca16bd80ef730ad947925cc0be852208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/bundle.json","state_url":"https://pith.science/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/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-06-26T13:28:23Z","links":{"resolver":"https://pith.science/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX","bundle":"https://pith.science/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/bundle.json","state":"https://pith.science/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWMVKCVWCN7R3RAYTFVMQB4ROX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OWMVKCVWCN7R3RAYTFVMQB4ROX","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":"984abd0f27f9b5514e7f784ca7339dd4980e013abc8bba7e65f021eb6bfa3ff6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T16:10:55Z","title_canon_sha256":"871b3c9fe7a7def6345b859515c187fab6a3e6641b2a3c5345fd7dc378b3bc48"},"schema_version":"1.0","source":{"id":"1803.10160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10160","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10160v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10160","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"OWMVKCVWCN7R","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OWMVKCVWCN7R3RAY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OWMVKCVW","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:41eacad63cfa502bd8c708144290deb5ca16bd80ef730ad947925cc0be852208","target":"graph","created_at":"2026-05-18T00:20: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":"A $biased\\ graph$ is a pair $(G,\\mathcal{B})$, where $G$ is a graph and $\\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type theorem, showing that if $(G,\\mathcal{B})$ is a biased graph which $G$ is a very large complete graph, then $G$ contains a large complete subgraph $H$ such that the set of balanced cycles within $H$ has one of three specific, highly symmetric structures, all of which can be described naturally via group-labellings.","authors_text":"Peter Nelson, Sophia Park","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T16:10:55Z","title":"A Ramsey theorem for biased graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10160","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:9442f4876aadc8b62fcb6e6b288a3b09c8b2ca4eb380ce3d705fd40e99aa5213","target":"record","created_at":"2026-05-18T00:20: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":"984abd0f27f9b5514e7f784ca7339dd4980e013abc8bba7e65f021eb6bfa3ff6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-27T16:10:55Z","title_canon_sha256":"871b3c9fe7a7def6345b859515c187fab6a3e6641b2a3c5345fd7dc378b3bc48"},"schema_version":"1.0","source":{"id":"1803.10160","kind":"arxiv","version":1}},"canonical_sha256":"7599550ab6137f1dc418996ac8079175d54b8752f867d7e37fb615bb14e406e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7599550ab6137f1dc418996ac8079175d54b8752f867d7e37fb615bb14e406e5","first_computed_at":"2026-05-18T00:20:00.216468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:00.216468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RlJaFjQVX7U74W3nq8r9s3du4YX4rER/LwDO/Se8aYvOfCX/M/cAB8UykcJyEw60Kw7rfk+JRuXNCM3dV8nMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:00.217081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9442f4876aadc8b62fcb6e6b288a3b09c8b2ca4eb380ce3d705fd40e99aa5213","sha256:41eacad63cfa502bd8c708144290deb5ca16bd80ef730ad947925cc0be852208"],"state_sha256":"3acfe841be8391bc0e3cff548632c155ef67752a1a52798c1cd117324942820b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i67Mj3zi4+1/QU8BonjR3s67eLNXs1omyP1YlSpD5YH89c0yF8tkkzmstSxjKBbOHTcLVY0sDcxMjEk7CdK7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:28:23.373958Z","bundle_sha256":"b3ddf7c97c285778c7489dc6525d73b9be0cf8831b4c52e4f6a225408c309ab4"}}