{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1994:XFY6I7Q2TLB2MARVCDFF3YZEHU","short_pith_number":"pith:XFY6I7Q2","canonical_record":{"source":{"id":"math/9409225","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e3d40cef33664967f760525af86948c52a64ac2f374819ac201f288dfdaff8d8","abstract_canon_sha256":"c56036d2b0bea4d39fecc176ace952b581504b1e0a6ad50655201bf47cb4fe37"},"schema_version":"1.0"},"canonical_sha256":"b971e47e1a9ac3a6023510ca5de3243d303c77a307574e7e4468ddddb9307765","source":{"kind":"arxiv","id":"math/9409225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409225","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409225v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409225","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"XFY6I7Q2TLB2","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"XFY6I7Q2TLB2MARV","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"XFY6I7Q2","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1994:XFY6I7Q2TLB2MARVCDFF3YZEHU","target":"record","payload":{"canonical_record":{"source":{"id":"math/9409225","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e3d40cef33664967f760525af86948c52a64ac2f374819ac201f288dfdaff8d8","abstract_canon_sha256":"c56036d2b0bea4d39fecc176ace952b581504b1e0a6ad50655201bf47cb4fe37"},"schema_version":"1.0"},"canonical_sha256":"b971e47e1a9ac3a6023510ca5de3243d303c77a307574e7e4468ddddb9307765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.062593Z","signature_b64":"Bh7Kupfn+tRpg9cnNIxpnByP93ArTldEQ9oC/TcvLH94fQGc0ZfibN9v7qMEBNelUBdqDn7jqR1zPQeN3h8+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b971e47e1a9ac3a6023510ca5de3243d303c77a307574e7e4468ddddb9307765","last_reissued_at":"2026-05-18T01:05:51.062046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.062046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/9409225","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-18T01:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaxsDpLhI33LhXslOtzc6a6C6aCzvMSgEnLJqw1o+O9/o6tGzDDUj6o3PpZRgR3tiyVBK4sE4qpS7TKU0YpaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:17:40.424776Z"},"content_sha256":"a196be8e04e471feac6292936898eb35fca87dbe6ebf3a05eefc909229969304","schema_version":"1.0","event_id":"sha256:a196be8e04e471feac6292936898eb35fca87dbe6ebf3a05eefc909229969304"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1994:XFY6I7Q2TLB2MARVCDFF3YZEHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of approximating PSPACE-Complete problems for hierarchical specifications","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi","submitted_at":"1994-09-21T00:00:00Z","abstract_excerpt":"We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence of such efficient approximation algorithms is characterized, for several standard graph theoretic and combinatorial problems. We present polynomial time approximation algorithms for several standard PSPACE-hard problems considered in the literature. In contrast, we show that unless P = PSPACE, there is no polynomial time epsilon-approximation for any epsilon>0, for several other problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409225","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-18T01:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C/fGYFyKVa68GHnxaLhqIHEY3evtzbz+tDGM1bupmOlcFMpL+9L4yXCBePRku02iXFDXk1lik+YWZHHvBV43Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:17:40.425444Z"},"content_sha256":"f4b6ff17619c9a1885333a1c1864b6d4522ad5b691ddefb461871359e5547abe","schema_version":"1.0","event_id":"sha256:f4b6ff17619c9a1885333a1c1864b6d4522ad5b691ddefb461871359e5547abe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/bundle.json","state_url":"https://pith.science/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/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-05-25T21:17:40Z","links":{"resolver":"https://pith.science/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU","bundle":"https://pith.science/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/bundle.json","state":"https://pith.science/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFY6I7Q2TLB2MARVCDFF3YZEHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:XFY6I7Q2TLB2MARVCDFF3YZEHU","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":"c56036d2b0bea4d39fecc176ace952b581504b1e0a6ad50655201bf47cb4fe37","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"e3d40cef33664967f760525af86948c52a64ac2f374819ac201f288dfdaff8d8"},"schema_version":"1.0","source":{"id":"math/9409225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409225","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409225v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409225","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"XFY6I7Q2TLB2","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"XFY6I7Q2TLB2MARV","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"XFY6I7Q2","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:f4b6ff17619c9a1885333a1c1864b6d4522ad5b691ddefb461871359e5547abe","target":"graph","created_at":"2026-05-18T01:05:51Z","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":"We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE, the existence or nonexistence of such efficient approximation algorithms is characterized, for several standard graph theoretic and combinatorial problems. We present polynomial time approximation algorithms for several standard PSPACE-hard problems considered in the literature. In contrast, we show that unless P = PSPACE, there is no polynomial time epsilon-approximation for any epsilon>0, for several other problem","authors_text":"Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title":"The complexity of approximating PSPACE-Complete problems for hierarchical specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409225","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:a196be8e04e471feac6292936898eb35fca87dbe6ebf3a05eefc909229969304","target":"record","created_at":"2026-05-18T01:05:51Z","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":"c56036d2b0bea4d39fecc176ace952b581504b1e0a6ad50655201bf47cb4fe37","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"e3d40cef33664967f760525af86948c52a64ac2f374819ac201f288dfdaff8d8"},"schema_version":"1.0","source":{"id":"math/9409225","kind":"arxiv","version":1}},"canonical_sha256":"b971e47e1a9ac3a6023510ca5de3243d303c77a307574e7e4468ddddb9307765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b971e47e1a9ac3a6023510ca5de3243d303c77a307574e7e4468ddddb9307765","first_computed_at":"2026-05-18T01:05:51.062046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:51.062046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bh7Kupfn+tRpg9cnNIxpnByP93ArTldEQ9oC/TcvLH94fQGc0ZfibN9v7qMEBNelUBdqDn7jqR1zPQeN3h8+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:51.062593Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9409225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a196be8e04e471feac6292936898eb35fca87dbe6ebf3a05eefc909229969304","sha256:f4b6ff17619c9a1885333a1c1864b6d4522ad5b691ddefb461871359e5547abe"],"state_sha256":"b5eb3d4086d5e6d831cee42b06203403c36d862886f1b8c79f4aeb777163b79e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8jeSc0Q/iL20sbiKkjJ06vqslRo6jKQRdYpFtHZzjcQaV82h/cWi3f2XvU4rB3wAnvAK0h1NNCHxHpiCFJ1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:17:40.428813Z","bundle_sha256":"a63bed3108b3746c9d794bac1a868d8668c4fa33aa0ca35017248db0911eab74"}}