{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1998:M5LDMCSJDWXJMHY6TZQBHLC56C","short_pith_number":"pith:M5LDMCSJ","canonical_record":{"source":{"id":"cs/9809064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-23T15:58:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d27257d4e28a80da5e340465922977bec7e67e03de93e68ab94c9634897376c4","abstract_canon_sha256":"307672db322f44ffe2864b923117f4c0c9fe6ab4f8c58b546555736c0d84ea3c"},"schema_version":"1.0"},"canonical_sha256":"6756360a491dae961f1e9e6013ac5df0a7095a241709037fa0697f56e05fb733","source":{"kind":"arxiv","id":"cs/9809064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809064","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9809064v1","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809064","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"M5LDMCSJDWXJ","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_16","alias_value":"M5LDMCSJDWXJMHY6","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_8","alias_value":"M5LDMCSJ","created_at":"2026-07-04T14:25:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1998:M5LDMCSJDWXJMHY6TZQBHLC56C","target":"record","payload":{"canonical_record":{"source":{"id":"cs/9809064","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-23T15:58:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d27257d4e28a80da5e340465922977bec7e67e03de93e68ab94c9634897376c4","abstract_canon_sha256":"307672db322f44ffe2864b923117f4c0c9fe6ab4f8c58b546555736c0d84ea3c"},"schema_version":"1.0"},"canonical_sha256":"6756360a491dae961f1e9e6013ac5df0a7095a241709037fa0697f56e05fb733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:25:06.920723Z","signature_b64":"ieVATljNlIjlc7tK+jRp1V9ArLrbpDy0Czv7mUzh+z61KU4PkBHE4EhvIKl7LkFlXF3bYHGAvyE7ek6sh707Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6756360a491dae961f1e9e6013ac5df0a7095a241709037fa0697f56e05fb733","last_reissued_at":"2026-07-04T14:25:06.920296Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:25:06.920296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/9809064","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-07-04T14:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTojZNfHj/j40DJNwijkYB2iie3/RJ6j0TaKBw2HvJ2HgCeQpoTVXKzLy5ezQk+Ub58V8vR5g4nUBMijTAhMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:43:17.002315Z"},"content_sha256":"4c7fb9567133b5c72956769d34415ec03a6737325665d8578b1058c95ce08946","schema_version":"1.0","event_id":"sha256:4c7fb9567133b5c72956769d34415ec03a6737325665d8578b1058c95ce08946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1998:M5LDMCSJDWXJMHY6TZQBHLC56C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Harry B. Hunt III, Madhav V. Marathe, Richard E. Stearns, Venkatesh Radhakrishnan","submitted_at":"1998-09-23T15:58:21Z","abstract_excerpt":"We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \\cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in \\cite{Wa93}. We show that, for most of the problems $\\Pi$ considered when specified using {\\bf k-level-restricted} hierarchical specifications or $k$-narrow periodic specifications the following holds:\n  \\item Let $\\rho$ be any performance guarantee of a polynomial time approximation algorithm for $\\Pi$, when instances are specified using standard specifications. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809064","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/9809064/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-04T14:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6g9ARpVQXCX7LK5WVtgmpLxCiJoCMr7AoXK/yET+cVIaxMvB2/DodRGRXECf14FFuuiPH2UV3sn+s+5GLEOBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T22:43:17.002881Z"},"content_sha256":"ee0de7cc49cdf8a510d67f9a108bb6027e6640e194070acf7890f559a7c0d85c","schema_version":"1.0","event_id":"sha256:ee0de7cc49cdf8a510d67f9a108bb6027e6640e194070acf7890f559a7c0d85c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/bundle.json","state_url":"https://pith.science/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/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-06T22:43:17Z","links":{"resolver":"https://pith.science/pith/M5LDMCSJDWXJMHY6TZQBHLC56C","bundle":"https://pith.science/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/bundle.json","state":"https://pith.science/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5LDMCSJDWXJMHY6TZQBHLC56C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1998:M5LDMCSJDWXJMHY6TZQBHLC56C","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":"307672db322f44ffe2864b923117f4c0c9fe6ab4f8c58b546555736c0d84ea3c","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-23T15:58:21Z","title_canon_sha256":"d27257d4e28a80da5e340465922977bec7e67e03de93e68ab94c9634897376c4"},"schema_version":"1.0","source":{"id":"cs/9809064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9809064","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9809064v1","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9809064","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"M5LDMCSJDWXJ","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_16","alias_value":"M5LDMCSJDWXJMHY6","created_at":"2026-07-04T14:25:06Z"},{"alias_kind":"pith_short_8","alias_value":"M5LDMCSJ","created_at":"2026-07-04T14:25:06Z"}],"graph_snapshots":[{"event_id":"sha256:ee0de7cc49cdf8a510d67f9a108bb6027e6640e194070acf7890f559a7c0d85c","target":"graph","created_at":"2026-07-04T14:25:06Z","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/cs/9809064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \\cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in \\cite{Wa93}. We show that, for most of the problems $\\Pi$ considered when specified using {\\bf k-level-restricted} hierarchical specifications or $k$-narrow periodic specifications the following holds:\n  \\item Let $\\rho$ be any performance guarantee of a polynomial time approximation algorithm for $\\Pi$, when instances are specified using standard specifications. The","authors_text":"Harry B. Hunt III, Madhav V. Marathe, Richard E. Stearns, Venkatesh Radhakrishnan","cross_cats":["cs.DS"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"1998-09-23T15:58:21Z","title":"Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9809064","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:4c7fb9567133b5c72956769d34415ec03a6737325665d8578b1058c95ce08946","target":"record","created_at":"2026-07-04T14:25:06Z","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":"307672db322f44ffe2864b923117f4c0c9fe6ab4f8c58b546555736c0d84ea3c","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.CC","submitted_at":"1998-09-23T15:58:21Z","title_canon_sha256":"d27257d4e28a80da5e340465922977bec7e67e03de93e68ab94c9634897376c4"},"schema_version":"1.0","source":{"id":"cs/9809064","kind":"arxiv","version":1}},"canonical_sha256":"6756360a491dae961f1e9e6013ac5df0a7095a241709037fa0697f56e05fb733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6756360a491dae961f1e9e6013ac5df0a7095a241709037fa0697f56e05fb733","first_computed_at":"2026-07-04T14:25:06.920296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:25:06.920296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ieVATljNlIjlc7tK+jRp1V9ArLrbpDy0Czv7mUzh+z61KU4PkBHE4EhvIKl7LkFlXF3bYHGAvyE7ek6sh707Cw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:25:06.920723Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9809064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c7fb9567133b5c72956769d34415ec03a6737325665d8578b1058c95ce08946","sha256:ee0de7cc49cdf8a510d67f9a108bb6027e6640e194070acf7890f559a7c0d85c"],"state_sha256":"5c02d602a65ed551567dce4b5d5fde31203abfeae2ea5f9e6e7b2e143d465aab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VoAOtwomCsIYN9TzlQZQ9fem/BNHXtZmOVd3G/xbIsYn3abiOGH64ngpVh4VMjvfdyFLWOWQQDCkwvXVXUihBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T22:43:17.007383Z","bundle_sha256":"8c83e654973c9b68c62dee490cd4fb3f9f0503ba2464407cddf7c3d065773d9e"}}