{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SJJI6G3FJN5KHZT6XY65KIKER6","short_pith_number":"pith:SJJI6G3F","canonical_record":{"source":{"id":"1605.07989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-25T18:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"a4634e26dc8eadd3e7245fc72b87510903351bf533d23bdd502d87f2eb76d236","abstract_canon_sha256":"2179c273016014bf67cdcba71a3c9ecde49a69c87e87e7ca611aefc8f7317e39"},"schema_version":"1.0"},"canonical_sha256":"92528f1b654b7aa3e67ebe3dd521448fb2f93a2b38aaf47d2b03c55d9b945cad","source":{"kind":"arxiv","id":"1605.07989","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07989","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07989v2","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07989","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"SJJI6G3FJN5K","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SJJI6G3FJN5KHZT6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SJJI6G3F","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SJJI6G3FJN5KHZT6XY65KIKER6","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07989","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-25T18:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"a4634e26dc8eadd3e7245fc72b87510903351bf533d23bdd502d87f2eb76d236","abstract_canon_sha256":"2179c273016014bf67cdcba71a3c9ecde49a69c87e87e7ca611aefc8f7317e39"},"schema_version":"1.0"},"canonical_sha256":"92528f1b654b7aa3e67ebe3dd521448fb2f93a2b38aaf47d2b03c55d9b945cad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:30.544882Z","signature_b64":"CK12gyFCd20qyo0uMokavAUat2dy3S4sDNxtNneCw/VWHY5fLTIndQA5v1fcjpiKn2NIyid18pNbOGYckCh+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92528f1b654b7aa3e67ebe3dd521448fb2f93a2b38aaf47d2b03c55d9b945cad","last_reissued_at":"2026-05-18T01:11:30.544517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:30.544517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07989","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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7zSesaMf3fcy+gMWUEEGp507ngPh3+lJD4Yxh4N2IRik0B/sck/dt5NgizOfhodxq941Rgmc4Dy8VjAvKXoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:06:57.678902Z"},"content_sha256":"b25fa9fb10bf05609a76859e97117aa27e7aed2ae5166dbb939d59e68af15afd","schema_version":"1.0","event_id":"sha256:b25fa9fb10bf05609a76859e97117aa27e7aed2ae5166dbb939d59e68af15afd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SJJI6G3FJN5KHZT6XY65KIKER6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compliant Conditions for Polynomial Time Approximation of Operator Counts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Sailik Sengupta, Sarath Sreedharan, Subbarao Kambhampati, Tathagata Chakraborti, T. K. Satish Kumar","submitted_at":"2016-05-25T18:10:48Z","abstract_excerpt":"In this paper, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is threefold, we (1) propose an efficient closed form approximation to the operator count heuristic using the Lagrangian dual; (2) leverage compressed sensing techniques to obtain an integer approximation for operator counts in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches appear to be useful."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07989","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-18T01:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7/0K5IcpVKfD/SmCn+1dRnnbH+qkScloHIXhgVcU/wGKToer8Q8nSnM+Y7pKU6a87kgSNBxzj1Sto8YFqqKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:06:57.679549Z"},"content_sha256":"e4f86d6b854b5324fee21b29a291d5f2b28550f8703aba28c31b55b0b726e612","schema_version":"1.0","event_id":"sha256:e4f86d6b854b5324fee21b29a291d5f2b28550f8703aba28c31b55b0b726e612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJJI6G3FJN5KHZT6XY65KIKER6/bundle.json","state_url":"https://pith.science/pith/SJJI6G3FJN5KHZT6XY65KIKER6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJJI6G3FJN5KHZT6XY65KIKER6/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-11T03:06:57Z","links":{"resolver":"https://pith.science/pith/SJJI6G3FJN5KHZT6XY65KIKER6","bundle":"https://pith.science/pith/SJJI6G3FJN5KHZT6XY65KIKER6/bundle.json","state":"https://pith.science/pith/SJJI6G3FJN5KHZT6XY65KIKER6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJJI6G3FJN5KHZT6XY65KIKER6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SJJI6G3FJN5KHZT6XY65KIKER6","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":"2179c273016014bf67cdcba71a3c9ecde49a69c87e87e7ca611aefc8f7317e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-25T18:10:48Z","title_canon_sha256":"a4634e26dc8eadd3e7245fc72b87510903351bf533d23bdd502d87f2eb76d236"},"schema_version":"1.0","source":{"id":"1605.07989","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07989","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07989v2","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07989","created_at":"2026-05-18T01:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"SJJI6G3FJN5K","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SJJI6G3FJN5KHZT6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SJJI6G3F","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:e4f86d6b854b5324fee21b29a291d5f2b28550f8703aba28c31b55b0b726e612","target":"graph","created_at":"2026-05-18T01:11:30Z","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":"In this paper, we develop a computationally simpler version of the operator count heuristic for a particular class of domains. The contribution of this abstract is threefold, we (1) propose an efficient closed form approximation to the operator count heuristic using the Lagrangian dual; (2) leverage compressed sensing techniques to obtain an integer approximation for operator counts in polynomial time; and (3) discuss the relationship of the proposed formulation to existing heuristics and investigate properties of domains where such approaches appear to be useful.","authors_text":"Sailik Sengupta, Sarath Sreedharan, Subbarao Kambhampati, Tathagata Chakraborti, T. K. Satish Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-25T18:10:48Z","title":"Compliant Conditions for Polynomial Time Approximation of Operator Counts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07989","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:b25fa9fb10bf05609a76859e97117aa27e7aed2ae5166dbb939d59e68af15afd","target":"record","created_at":"2026-05-18T01:11:30Z","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":"2179c273016014bf67cdcba71a3c9ecde49a69c87e87e7ca611aefc8f7317e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-25T18:10:48Z","title_canon_sha256":"a4634e26dc8eadd3e7245fc72b87510903351bf533d23bdd502d87f2eb76d236"},"schema_version":"1.0","source":{"id":"1605.07989","kind":"arxiv","version":2}},"canonical_sha256":"92528f1b654b7aa3e67ebe3dd521448fb2f93a2b38aaf47d2b03c55d9b945cad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92528f1b654b7aa3e67ebe3dd521448fb2f93a2b38aaf47d2b03c55d9b945cad","first_computed_at":"2026-05-18T01:11:30.544517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:30.544517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CK12gyFCd20qyo0uMokavAUat2dy3S4sDNxtNneCw/VWHY5fLTIndQA5v1fcjpiKn2NIyid18pNbOGYckCh+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:30.544882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07989","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b25fa9fb10bf05609a76859e97117aa27e7aed2ae5166dbb939d59e68af15afd","sha256:e4f86d6b854b5324fee21b29a291d5f2b28550f8703aba28c31b55b0b726e612"],"state_sha256":"1441878d53df06e4f9687e9b8d2aacbbf259f219752599d04f6ae6b7ed53b6b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0u9/6iftyuNG6aDWMJhw6hVg8itD1EFRIBBJol1HoALghbeREhnGsC7E8m80zthxjdZFgKgIilVKDVXySFwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:06:57.683570Z","bundle_sha256":"f07bf9aa08281368619cf3c3ab2ab9a418210553f7f3fdf063da57b52442e47f"}}