{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MXELM4NHXRFRC5ME2YBCBN3GO5","short_pith_number":"pith:MXELM4NH","canonical_record":{"source":{"id":"1304.5429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-19T14:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"a48020b0771c7147662a548a0469f5fae657c5d502c16d13798909b67ef92f5e","abstract_canon_sha256":"bf45b2b1c1f5819676c1fc5cabd7f763a67d626e56e247fb1b3987a7e82b60b3"},"schema_version":"1.0"},"canonical_sha256":"65c8b671a7bc4b117584d60220b76677469163593ff7f2b8203f54f71d9f8f98","source":{"kind":"arxiv","id":"1304.5429","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5429","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5429v3","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5429","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"MXELM4NHXRFR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MXELM4NHXRFRC5ME","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MXELM4NH","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MXELM4NHXRFRC5ME2YBCBN3GO5","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-19T14:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"a48020b0771c7147662a548a0469f5fae657c5d502c16d13798909b67ef92f5e","abstract_canon_sha256":"bf45b2b1c1f5819676c1fc5cabd7f763a67d626e56e247fb1b3987a7e82b60b3"},"schema_version":"1.0"},"canonical_sha256":"65c8b671a7bc4b117584d60220b76677469163593ff7f2b8203f54f71d9f8f98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:47.068545Z","signature_b64":"PbXht27YSQvzTa0mMLaibU+v/5kywxNKkytZtRRmkBgHgAohFnpGMnCcrkh1HCzr8hvPYapvWGm3x2Qxu7YLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65c8b671a7bc4b117584d60220b76677469163593ff7f2b8203f54f71d9f8f98","last_reissued_at":"2026-05-18T02:54:47.068157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:47.068157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5429","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-05-18T02:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4QAAIAHbJ0f62vHEYsV5wNWO4CJJHuU3pVdc5VoYkhudldgWXlLWmXqwHBCoEnJKy1u5acXIDgnHHf64pZaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:45:23.397573Z"},"content_sha256":"2851aeb61ee0cfa0943eb7d8467482c2df650a2432c1ec306e0d91f47dd636ca","schema_version":"1.0","event_id":"sha256:2851aeb61ee0cfa0943eb7d8467482c2df650a2432c1ec306e0d91f47dd636ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MXELM4NHXRFRC5ME2YBCBN3GO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2013-04-19T14:34:47Z","abstract_excerpt":"The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and division gates, and integer inputs:\n  Input instance: four lists of positive integers: a_1, ...., a_n ; b_1,...., b_n ; c_1,....,c_m ; d_1, ...., d_m ; where each of the integers is represented in binary.\n  Problem 1 (equality testing): Decide whether a_1^{b_1} a_2^{b_2} .... a_n^{b_n} = c_1^{d_1} c_2^{d_2} .... c_m^{d_m} .\n  Problem 2 (inequality testing): Decide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5429","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":""},"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDJb0Sx80tFCC4sBHcPA1hKvexXS80LN82ssGJqdr6ekpLn+OBpfOzYaU+1yhxEWerQw3I4YTuDANmG/22wICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:45:23.397912Z"},"content_sha256":"69d20bfd041d9903fb925b37571bc91b4cbf5a18c5d217124b5f2536226a3104","schema_version":"1.0","event_id":"sha256:69d20bfd041d9903fb925b37571bc91b4cbf5a18c5d217124b5f2536226a3104"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/bundle.json","state_url":"https://pith.science/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/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-21T03:45:23Z","links":{"resolver":"https://pith.science/pith/MXELM4NHXRFRC5ME2YBCBN3GO5","bundle":"https://pith.science/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/bundle.json","state":"https://pith.science/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXELM4NHXRFRC5ME2YBCBN3GO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MXELM4NHXRFRC5ME2YBCBN3GO5","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":"bf45b2b1c1f5819676c1fc5cabd7f763a67d626e56e247fb1b3987a7e82b60b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-19T14:34:47Z","title_canon_sha256":"a48020b0771c7147662a548a0469f5fae657c5d502c16d13798909b67ef92f5e"},"schema_version":"1.0","source":{"id":"1304.5429","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5429","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5429v3","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5429","created_at":"2026-05-18T02:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"MXELM4NHXRFR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MXELM4NHXRFRC5ME","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MXELM4NH","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:69d20bfd041d9903fb925b37571bc91b4cbf5a18c5d217124b5f2536226a3104","target":"graph","created_at":"2026-05-18T02:54:47Z","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":"The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and division gates, and integer inputs:\n  Input instance: four lists of positive integers: a_1, ...., a_n ; b_1,...., b_n ; c_1,....,c_m ; d_1, ...., d_m ; where each of the integers is represented in binary.\n  Problem 1 (equality testing): Decide whether a_1^{b_1} a_2^{b_2} .... a_n^{b_n} = c_1^{d_1} c_2^{d_2} .... c_m^{d_m} .\n  Problem 2 (inequality testing): Decide","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-19T14:34:47Z","title":"A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5429","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:2851aeb61ee0cfa0943eb7d8467482c2df650a2432c1ec306e0d91f47dd636ca","target":"record","created_at":"2026-05-18T02:54:47Z","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":"bf45b2b1c1f5819676c1fc5cabd7f763a67d626e56e247fb1b3987a7e82b60b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-19T14:34:47Z","title_canon_sha256":"a48020b0771c7147662a548a0469f5fae657c5d502c16d13798909b67ef92f5e"},"schema_version":"1.0","source":{"id":"1304.5429","kind":"arxiv","version":3}},"canonical_sha256":"65c8b671a7bc4b117584d60220b76677469163593ff7f2b8203f54f71d9f8f98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65c8b671a7bc4b117584d60220b76677469163593ff7f2b8203f54f71d9f8f98","first_computed_at":"2026-05-18T02:54:47.068157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:47.068157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PbXht27YSQvzTa0mMLaibU+v/5kywxNKkytZtRRmkBgHgAohFnpGMnCcrkh1HCzr8hvPYapvWGm3x2Qxu7YLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:47.068545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5429","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2851aeb61ee0cfa0943eb7d8467482c2df650a2432c1ec306e0d91f47dd636ca","sha256:69d20bfd041d9903fb925b37571bc91b4cbf5a18c5d217124b5f2536226a3104"],"state_sha256":"de0963fcde60626d3c42972be8222d2fc46eea11ca3a38ff36d245e5d9483db9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8RJbg/LyXxhRmWTq+L8CKeybUra/mbfFexKgazrSVUlkiUqLUbAOIauou+q2jQ8Mg1og7oNwmfacspfuJALCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:45:23.399885Z","bundle_sha256":"853b8a7ab7edfbbdf7da61580b44b61471e578e7682d10ccfcb18637586643b3"}}