{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:F3AUALM3H7V3OMXBPLHD4OLTSF","short_pith_number":"pith:F3AUALM3","canonical_record":{"source":{"id":"1908.08237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T07:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"de3c9036e823e1e324990cd2ee107ffbf6504db1976ca6d1cc2b0b846d64b378","abstract_canon_sha256":"8557c83c999068b7b901b2072599d587c501ac7fda87c57cd85df1e357f6ad1e"},"schema_version":"1.0"},"canonical_sha256":"2ec1402d9b3febb732e17ace3e3973916c28325edbd56381ddf24c0675b939ce","source":{"kind":"arxiv","id":"1908.08237","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08237","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08237v3","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08237","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"F3AUALM3H7V3","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"F3AUALM3H7V3OMXB","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"F3AUALM3","created_at":"2026-07-05T00:35:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:F3AUALM3H7V3OMXBPLHD4OLTSF","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08237","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T07:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"de3c9036e823e1e324990cd2ee107ffbf6504db1976ca6d1cc2b0b846d64b378","abstract_canon_sha256":"8557c83c999068b7b901b2072599d587c501ac7fda87c57cd85df1e357f6ad1e"},"schema_version":"1.0"},"canonical_sha256":"2ec1402d9b3febb732e17ace3e3973916c28325edbd56381ddf24c0675b939ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:01.801159Z","signature_b64":"18NgxzLdZign4Oty0Qg4XqY/Tg4uwRQKn7Hae5cMRno0UEbGCw3ifBR9VZfAIi8ODDGTXXPihoNd2OB5Ei0WDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ec1402d9b3febb732e17ace3e3973916c28325edbd56381ddf24c0675b939ce","last_reissued_at":"2026-07-05T00:35:01.800713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:01.800713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08237","source_version":3,"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-07-05T00:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NEfEL4qU1sRw29O5jkThtCyv4pgORa6uOeeZsIlRK7adX7q5S/rLu9mMJSoxbVuokzjZxW9N2ssOiuTi9FykDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:41:08.690475Z"},"content_sha256":"b5d1ec64a65f71e8e8a08e52f5992fe5e78e19c5ffd8697cba7fffff58e0f112","schema_version":"1.0","event_id":"sha256:b5d1ec64a65f71e8e8a08e52f5992fe5e78e19c5ffd8697cba7fffff58e0f112"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:F3AUALM3H7V3OMXBPLHD4OLTSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On small balanceable, strongly-balanceable and omnitonal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2019-08-22T07:34:08Z","abstract_excerpt":"In Ramsey theory for graphs we are given a graph $G$ and we are required to find the least $n_0$ such that, for any $n\\geq n_0$, any red/blue colouring of the edges of $K_n$ gives a subgraph $G$ all of whose edges are blue or all are red. Here we shall be requiring that, for any red/blue colouring of the edges of $K_n$, there must be a copy of $G$ such that its edges are partitioned equally as red or blue (or the sizes of the colour classes differs by one in the case when $G$ has an odd number of edges). This introduces the notion of balanceable graphs and the balance number of $G$ which, if i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08237","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08237/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"movqRu8BomP9ZV+VPWw57MjvdNVZiG7CWulc5uwt+2PDQEcH6w9gqhM1XU0NZKXF+NvXfLl0tBquC2kNcxEYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:41:08.691035Z"},"content_sha256":"31081cfd006160532b2402273913a4c3705ca2ba9fdd5db860a0504acebec4f9","schema_version":"1.0","event_id":"sha256:31081cfd006160532b2402273913a4c3705ca2ba9fdd5db860a0504acebec4f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/bundle.json","state_url":"https://pith.science/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/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-08-16T16:41:08Z","links":{"resolver":"https://pith.science/pith/F3AUALM3H7V3OMXBPLHD4OLTSF","bundle":"https://pith.science/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/bundle.json","state":"https://pith.science/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3AUALM3H7V3OMXBPLHD4OLTSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:F3AUALM3H7V3OMXBPLHD4OLTSF","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":"8557c83c999068b7b901b2072599d587c501ac7fda87c57cd85df1e357f6ad1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T07:34:08Z","title_canon_sha256":"de3c9036e823e1e324990cd2ee107ffbf6504db1976ca6d1cc2b0b846d64b378"},"schema_version":"1.0","source":{"id":"1908.08237","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08237","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08237v3","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08237","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"F3AUALM3H7V3","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_16","alias_value":"F3AUALM3H7V3OMXB","created_at":"2026-07-05T00:35:01Z"},{"alias_kind":"pith_short_8","alias_value":"F3AUALM3","created_at":"2026-07-05T00:35:01Z"}],"graph_snapshots":[{"event_id":"sha256:31081cfd006160532b2402273913a4c3705ca2ba9fdd5db860a0504acebec4f9","target":"graph","created_at":"2026-07-05T00:35:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08237/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In Ramsey theory for graphs we are given a graph $G$ and we are required to find the least $n_0$ such that, for any $n\\geq n_0$, any red/blue colouring of the edges of $K_n$ gives a subgraph $G$ all of whose edges are blue or all are red. Here we shall be requiring that, for any red/blue colouring of the edges of $K_n$, there must be a copy of $G$ such that its edges are partitioned equally as red or blue (or the sizes of the colour classes differs by one in the case when $G$ has an odd number of edges). This introduces the notion of balanceable graphs and the balance number of $G$ which, if i","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T07:34:08Z","title":"On small balanceable, strongly-balanceable and omnitonal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08237","kind":"arxiv","version":3},"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:b5d1ec64a65f71e8e8a08e52f5992fe5e78e19c5ffd8697cba7fffff58e0f112","target":"record","created_at":"2026-07-05T00:35:01Z","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":"8557c83c999068b7b901b2072599d587c501ac7fda87c57cd85df1e357f6ad1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-22T07:34:08Z","title_canon_sha256":"de3c9036e823e1e324990cd2ee107ffbf6504db1976ca6d1cc2b0b846d64b378"},"schema_version":"1.0","source":{"id":"1908.08237","kind":"arxiv","version":3}},"canonical_sha256":"2ec1402d9b3febb732e17ace3e3973916c28325edbd56381ddf24c0675b939ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ec1402d9b3febb732e17ace3e3973916c28325edbd56381ddf24c0675b939ce","first_computed_at":"2026-07-05T00:35:01.800713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:01.800713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"18NgxzLdZign4Oty0Qg4XqY/Tg4uwRQKn7Hae5cMRno0UEbGCw3ifBR9VZfAIi8ODDGTXXPihoNd2OB5Ei0WDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:01.801159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08237","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d1ec64a65f71e8e8a08e52f5992fe5e78e19c5ffd8697cba7fffff58e0f112","sha256:31081cfd006160532b2402273913a4c3705ca2ba9fdd5db860a0504acebec4f9"],"state_sha256":"985209ad3c92737534706d2ed775c2b02b495a3510023cc8ea2d000e1b475b8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4070wpvtdcg4YrSUZ6kl7EEm82zRxfKhqsZhrQxjFXNC//iyopd32QuW+u4ijaPwxrzZm7zRrhSGR3ZlRZfgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:41:08.696587Z","bundle_sha256":"27d321f900b8cf09dc809908483ed11d1a5c179715c563e205dfb0118992ca18"}}