{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DUMPD7MQUOVFEA7GGB3JCDMTS5","short_pith_number":"pith:DUMPD7MQ","canonical_record":{"source":{"id":"1006.1324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T18:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"596c1802cd077feca6248b3c9146095f7a99191a9dd424872bad32a9189967a4","abstract_canon_sha256":"9f448147349e857db6a5570416e76ac78a1956875ab21e1ddfbd5bc95167182c"},"schema_version":"1.0"},"canonical_sha256":"1d18f1fd90a3aa5203e63076910d9397500a64a1b55547ea10dda081596826d0","source":{"kind":"arxiv","id":"1006.1324","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1324","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1324v2","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1324","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"DUMPD7MQUOVF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DUMPD7MQUOVFEA7G","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DUMPD7MQ","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DUMPD7MQUOVFEA7GGB3JCDMTS5","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T18:33:52Z","cross_cats_sorted":[],"title_canon_sha256":"596c1802cd077feca6248b3c9146095f7a99191a9dd424872bad32a9189967a4","abstract_canon_sha256":"9f448147349e857db6a5570416e76ac78a1956875ab21e1ddfbd5bc95167182c"},"schema_version":"1.0"},"canonical_sha256":"1d18f1fd90a3aa5203e63076910d9397500a64a1b55547ea10dda081596826d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:05.495893Z","signature_b64":"ZS3vVFafPF41s9tZLgxCzSrKXUBhpeDqa+mzqIOojG3Icw/Lxubd0wKYS0cBiHLDhkL2juhzsK/5hHYaeakRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d18f1fd90a3aa5203e63076910d9397500a64a1b55547ea10dda081596826d0","last_reissued_at":"2026-05-18T02:54:05.495125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:05.495125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1324","source_version":2,"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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2qmVs9VJODFjTuOYH/mzCwyYdz9hZkJmVW8HPFcvFwyNHZnfW00W4YvZfCCMbEAc1LRslHH2kxQtLqq+sITCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:33:42.080160Z"},"content_sha256":"4f5b382ef2301b7411bc77c07e72b212f7fdd02d15095a812a746100198ce0a4","schema_version":"1.0","event_id":"sha256:4f5b382ef2301b7411bc77c07e72b212f7fdd02d15095a812a746100198ce0a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DUMPD7MQUOVFEA7GGB3JCDMTS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward a language theoretic proof of the four color theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobbe Cooper, Doron Zeilberger, Eric Rowland","submitted_at":"2010-06-07T18:33:52Z","abstract_excerpt":"This paper considers the problem of showing that every pair of binary trees with the same number of leaves parses a common word under a certain simple grammar. We enumerate the common parse words for several infinite families of tree pairs and discuss several ways to reduce the problem of finding a parse word for a pair of trees to that for a smaller pair. The statement that every pair of trees has a common parse word is equivalent to the statement that every planar graph is four-colorable, so the results are a step toward a language theoretic proof of the four color theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1324","kind":"arxiv","version":2},"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:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHXz5Jw/TmuJylNTx4uC9Amy0mpkDjAkmnRHtilxrTkEJXqb5pLSA7ju6Pv1jHnRkp+7pfs1//18p95DANw/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:33:42.080522Z"},"content_sha256":"3ee8a3fae41898e51830415dffbdad54a866e9f9747086249236695028cb6670","schema_version":"1.0","event_id":"sha256:3ee8a3fae41898e51830415dffbdad54a866e9f9747086249236695028cb6670"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/bundle.json","state_url":"https://pith.science/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/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-09T12:33:42Z","links":{"resolver":"https://pith.science/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5","bundle":"https://pith.science/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/bundle.json","state":"https://pith.science/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUMPD7MQUOVFEA7GGB3JCDMTS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DUMPD7MQUOVFEA7GGB3JCDMTS5","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":"9f448147349e857db6a5570416e76ac78a1956875ab21e1ddfbd5bc95167182c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T18:33:52Z","title_canon_sha256":"596c1802cd077feca6248b3c9146095f7a99191a9dd424872bad32a9189967a4"},"schema_version":"1.0","source":{"id":"1006.1324","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1324","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1324v2","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1324","created_at":"2026-05-18T02:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"DUMPD7MQUOVF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DUMPD7MQUOVFEA7G","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DUMPD7MQ","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:3ee8a3fae41898e51830415dffbdad54a866e9f9747086249236695028cb6670","target":"graph","created_at":"2026-05-18T02:54:05Z","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":"This paper considers the problem of showing that every pair of binary trees with the same number of leaves parses a common word under a certain simple grammar. We enumerate the common parse words for several infinite families of tree pairs and discuss several ways to reduce the problem of finding a parse word for a pair of trees to that for a smaller pair. The statement that every pair of trees has a common parse word is equivalent to the statement that every planar graph is four-colorable, so the results are a step toward a language theoretic proof of the four color theorem.","authors_text":"Bobbe Cooper, Doron Zeilberger, Eric Rowland","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T18:33:52Z","title":"Toward a language theoretic proof of the four color theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1324","kind":"arxiv","version":2},"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:4f5b382ef2301b7411bc77c07e72b212f7fdd02d15095a812a746100198ce0a4","target":"record","created_at":"2026-05-18T02:54:05Z","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":"9f448147349e857db6a5570416e76ac78a1956875ab21e1ddfbd5bc95167182c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-07T18:33:52Z","title_canon_sha256":"596c1802cd077feca6248b3c9146095f7a99191a9dd424872bad32a9189967a4"},"schema_version":"1.0","source":{"id":"1006.1324","kind":"arxiv","version":2}},"canonical_sha256":"1d18f1fd90a3aa5203e63076910d9397500a64a1b55547ea10dda081596826d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d18f1fd90a3aa5203e63076910d9397500a64a1b55547ea10dda081596826d0","first_computed_at":"2026-05-18T02:54:05.495125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:05.495125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS3vVFafPF41s9tZLgxCzSrKXUBhpeDqa+mzqIOojG3Icw/Lxubd0wKYS0cBiHLDhkL2juhzsK/5hHYaeakRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:05.495893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1324","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5b382ef2301b7411bc77c07e72b212f7fdd02d15095a812a746100198ce0a4","sha256:3ee8a3fae41898e51830415dffbdad54a866e9f9747086249236695028cb6670"],"state_sha256":"8f35157aee6083dbc0bdc865f7090ef6d0d13e773db4cd824a7ab236380fbfca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YM9tS3RZ+AI9/Gqv8OZraRIRNx/A7NVihFn840/DwqZ+nPqV0G0YbkYuh1QAYSADjbVeFdfYHei+eAbF2FlBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:33:42.082752Z","bundle_sha256":"773490f35b88f5e0701b9011eaf46e4862d0a0664dc2f52158cbbc33a805cded"}}