{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TWGEKTVXOCEIL3OGZQ6QVE34WD","short_pith_number":"pith:TWGEKTVX","schema_version":"1.0","canonical_sha256":"9d8c454eb7708885edc6cc3d0a937cb0dad36cdc6e83e85ee404f6690cbbb9a9","source":{"kind":"arxiv","id":"1212.2476","version":1},"attestation_state":"computed","paper":{"title":"Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Ephraim Larkin","submitted_at":"2012-10-19T15:06:19Z","abstract_excerpt":"In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intractable for exact algorithms because of the large number of dependency relationships in their structure. Our method effectively maps such a dense problem to a sparser one which is in some sense \"closest\". Exact methods can be run on the sparser problem to derive bounds on the original answer, which can be quite sharp. We present empirical results demonstrating that our method works well on the tasks of belief inference a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1212.2476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:19Z","cross_cats_sorted":[],"title_canon_sha256":"091f3e4f55f48f77cf51cf5d5e9516de0e5315f76627fa44473b1a60212fcbe5","abstract_canon_sha256":"0318ea49d50ac1557ee06e702f86f159716d025d428d99d8b90b9128057f11c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.715515Z","signature_b64":"uzVbWyNMeJCigPOsft3GyuXZPFqYmdZyAlejCs0skRrPuCRh9SZA2CyCa8kCtej6HKEZbXMIy/BV1tOs8n6MBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d8c454eb7708885edc6cc3d0a937cb0dad36cdc6e83e85ee404f6690cbbb9a9","last_reissued_at":"2026-05-18T03:38:44.714798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.714798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Ephraim Larkin","submitted_at":"2012-10-19T15:06:19Z","abstract_excerpt":"In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intractable for exact algorithms because of the large number of dependency relationships in their structure. Our method effectively maps such a dense problem to a sparser one which is in some sense \"closest\". Exact methods can be run on the sparser problem to derive bounds on the original answer, which can be quite sharp. We present empirical results demonstrating that our method works well on the tasks of belief inference a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2476","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.2476","created_at":"2026-05-18T03:38:44.714925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2476v1","created_at":"2026-05-18T03:38:44.714925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2476","created_at":"2026-05-18T03:38:44.714925+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWGEKTVXOCEI","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWGEKTVXOCEIL3OG","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWGEKTVX","created_at":"2026-05-18T12:27:23.164592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD","json":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD.json","graph_json":"https://pith.science/api/pith-number/TWGEKTVXOCEIL3OGZQ6QVE34WD/graph.json","events_json":"https://pith.science/api/pith-number/TWGEKTVXOCEIL3OGZQ6QVE34WD/events.json","paper":"https://pith.science/paper/TWGEKTVX"},"agent_actions":{"view_html":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD","download_json":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD.json","view_paper":"https://pith.science/paper/TWGEKTVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2476&json=true","fetch_graph":"https://pith.science/api/pith-number/TWGEKTVXOCEIL3OGZQ6QVE34WD/graph.json","fetch_events":"https://pith.science/api/pith-number/TWGEKTVXOCEIL3OGZQ6QVE34WD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD/action/storage_attestation","attest_author":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD/action/author_attestation","sign_citation":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD/action/citation_signature","submit_replication":"https://pith.science/pith/TWGEKTVXOCEIL3OGZQ6QVE34WD/action/replication_record"}},"created_at":"2026-05-18T03:38:44.714925+00:00","updated_at":"2026-05-18T03:38:44.714925+00:00"}