{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RT6APCOLAXVBITTKRACQF5QHAG","short_pith_number":"pith:RT6APCOL","canonical_record":{"source":{"id":"1904.08402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-17T17:57:41Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"e633b0938a40823658b4c6296dec07e440242e080e4db88b33791f7a6964f9ee","abstract_canon_sha256":"b466aec922e6efea875ce02d920880cc25dab4c044361292afd07788a80aa38c"},"schema_version":"1.0"},"canonical_sha256":"8cfc0789cb05ea144e6a880502f60701ab7c98b79445abb16be9dc200f53399c","source":{"kind":"arxiv","id":"1904.08402","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08402","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08402v1","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08402","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"RT6APCOLAXVB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RT6APCOLAXVBITTK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RT6APCOL","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RT6APCOLAXVBITTKRACQF5QHAG","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-17T17:57:41Z","cross_cats_sorted":["cs.LO","math.CO"],"title_canon_sha256":"e633b0938a40823658b4c6296dec07e440242e080e4db88b33791f7a6964f9ee","abstract_canon_sha256":"b466aec922e6efea875ce02d920880cc25dab4c044361292afd07788a80aa38c"},"schema_version":"1.0"},"canonical_sha256":"8cfc0789cb05ea144e6a880502f60701ab7c98b79445abb16be9dc200f53399c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:17.790655Z","signature_b64":"Zxtem7xr5BWOWH0GSEEPsNME5KH3SEYZv/sxt18/higY/l4qP74cgiDKXpkgPQMAED7W1QcfZQNROg8pPbmNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cfc0789cb05ea144e6a880502f60701ab7c98b79445abb16be9dc200f53399c","last_reissued_at":"2026-05-17T23:48:17.790106Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:17.790106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08402","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-17T23:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jp/vTbf1MgErahHaBEl3MPKNe9HmCyy0qll48l7jNV+vFjQ2w/YA0pRIt6xKZVcqWnbcIa6sPZUQytKsSSCfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:16:06.153009Z"},"content_sha256":"a17097070c9b0d028b82efbc078ff9137b12590d3ed8b8157d1dcf53842aa092","schema_version":"1.0","event_id":"sha256:a17097070c9b0d028b82efbc078ff9137b12590d3ed8b8157d1dcf53842aa092"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RT6APCOLAXVBITTKRACQF5QHAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Re-pairing brackets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO"],"primary_cat":"cs.FL","authors_text":"Dmitry Chistikov, Mikhail Vyalyi","submitted_at":"2019-04-17T17:57:41Z","abstract_excerpt":"Consider the following one-player game. Take a well-formed sequence of opening and closing brackets. As a move, the player can pair any opening bracket with any closing bracket to its right, erasing them. The goal is to re-pair (erase) the entire sequence, and the complexity of a strategy is measured by its width: the maximum number of nonempty segments of symbols (separated by blank space) seen during the play.\n  For various initial sequences, we prove upper and lower bounds on the minimum width sufficient for re-pairing. (In particular, the sequence associated with the complete binary tree o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08402","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-17T23:48:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4FJT3Upa2GrEdm06HwOBhzKeOviHtYsP6PiGTz55AwYUJAQAmsdY40uZ3abeRQPDGlfvUg3aqJpEqcwuDXhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:16:06.153363Z"},"content_sha256":"2d1883566d228686439b0c10e573de835a4acf1b4ba3e69d7dc3c3dd5e98e0eb","schema_version":"1.0","event_id":"sha256:2d1883566d228686439b0c10e573de835a4acf1b4ba3e69d7dc3c3dd5e98e0eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RT6APCOLAXVBITTKRACQF5QHAG/bundle.json","state_url":"https://pith.science/pith/RT6APCOLAXVBITTKRACQF5QHAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RT6APCOLAXVBITTKRACQF5QHAG/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-07-04T08:16:06Z","links":{"resolver":"https://pith.science/pith/RT6APCOLAXVBITTKRACQF5QHAG","bundle":"https://pith.science/pith/RT6APCOLAXVBITTKRACQF5QHAG/bundle.json","state":"https://pith.science/pith/RT6APCOLAXVBITTKRACQF5QHAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RT6APCOLAXVBITTKRACQF5QHAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RT6APCOLAXVBITTKRACQF5QHAG","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":"b466aec922e6efea875ce02d920880cc25dab4c044361292afd07788a80aa38c","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-17T17:57:41Z","title_canon_sha256":"e633b0938a40823658b4c6296dec07e440242e080e4db88b33791f7a6964f9ee"},"schema_version":"1.0","source":{"id":"1904.08402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08402","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08402v1","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08402","created_at":"2026-05-17T23:48:17Z"},{"alias_kind":"pith_short_12","alias_value":"RT6APCOLAXVB","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RT6APCOLAXVBITTK","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RT6APCOL","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2d1883566d228686439b0c10e573de835a4acf1b4ba3e69d7dc3c3dd5e98e0eb","target":"graph","created_at":"2026-05-17T23:48:17Z","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":"Consider the following one-player game. Take a well-formed sequence of opening and closing brackets. As a move, the player can pair any opening bracket with any closing bracket to its right, erasing them. The goal is to re-pair (erase) the entire sequence, and the complexity of a strategy is measured by its width: the maximum number of nonempty segments of symbols (separated by blank space) seen during the play.\n  For various initial sequences, we prove upper and lower bounds on the minimum width sufficient for re-pairing. (In particular, the sequence associated with the complete binary tree o","authors_text":"Dmitry Chistikov, Mikhail Vyalyi","cross_cats":["cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-17T17:57:41Z","title":"Re-pairing brackets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08402","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:a17097070c9b0d028b82efbc078ff9137b12590d3ed8b8157d1dcf53842aa092","target":"record","created_at":"2026-05-17T23:48:17Z","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":"b466aec922e6efea875ce02d920880cc25dab4c044361292afd07788a80aa38c","cross_cats_sorted":["cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-17T17:57:41Z","title_canon_sha256":"e633b0938a40823658b4c6296dec07e440242e080e4db88b33791f7a6964f9ee"},"schema_version":"1.0","source":{"id":"1904.08402","kind":"arxiv","version":1}},"canonical_sha256":"8cfc0789cb05ea144e6a880502f60701ab7c98b79445abb16be9dc200f53399c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cfc0789cb05ea144e6a880502f60701ab7c98b79445abb16be9dc200f53399c","first_computed_at":"2026-05-17T23:48:17.790106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:17.790106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zxtem7xr5BWOWH0GSEEPsNME5KH3SEYZv/sxt18/higY/l4qP74cgiDKXpkgPQMAED7W1QcfZQNROg8pPbmNDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:17.790655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a17097070c9b0d028b82efbc078ff9137b12590d3ed8b8157d1dcf53842aa092","sha256:2d1883566d228686439b0c10e573de835a4acf1b4ba3e69d7dc3c3dd5e98e0eb"],"state_sha256":"a7ae463daa5f078e98ee933d12bb1f6563d85ccf20f92b0b617b54afcb2bc11e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYtcU38tFTLyUJiuCaSNGqXwj6RPdwRkwgSt9OLLLt4nD7eKRswFyifdcYQb0ikfP6yx6nmw1zOgHRKHsQw/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T08:16:06.155554Z","bundle_sha256":"db042189b69d3e3ba4c1d0bc7b415f71e5bb4fa6020c7e6b085cc0273b9497c5"}}