{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5JDHBRO3JR3AGESFMK5VGBTGP7","short_pith_number":"pith:5JDHBRO3","schema_version":"1.0","canonical_sha256":"ea4670c5db4c7603124562bb5306667fe50b7e2c5b1b570c8d5aac4567c9fe7e","source":{"kind":"arxiv","id":"1302.3573","version":1},"attestation_state":"computed","paper":{"title":"Topological Parameters for Time-Space Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Rina Dechter","submitted_at":"2013-02-13T14:13:38Z","abstract_excerpt":"In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time.  Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space specification."},"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":"1302.3573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:13:38Z","cross_cats_sorted":[],"title_canon_sha256":"a90367e2c6c1b3a1f17a80f502077305b0d7f84ed6a2ff3e2ec441502c6bc9fe","abstract_canon_sha256":"d419992437789a5eb11e11becd7cac0ea3686025375f3ec4c782f7fb295f2733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.753535Z","signature_b64":"pNO8l7z4VhOUYgh+hLY4fAib4ygyWt3mbOuLl2tU7PV7oxjX8OuMuxJUi9Bed7nkIHG3NSNwly6bgtnoKCEFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea4670c5db4c7603124562bb5306667fe50b7e2c5b1b570c8d5aac4567c9fe7e","last_reissued_at":"2026-05-18T03:33:36.752710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.752710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological Parameters for Time-Space Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Rina Dechter","submitted_at":"2013-02-13T14:13:38Z","abstract_excerpt":"In this paper we propose a family of algorithms combining tree-clustering with conditioning that trade space for time.  Such algorithms are useful for reasoning in probabilistic and deterministic networks as well as for accomplishing optimization tasks. By analyzing the problem structure it will be possible to select from a spectrum the algorithm that best meets a given time-space specification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3573","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":"1302.3573","created_at":"2026-05-18T03:33:36.752843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3573v1","created_at":"2026-05-18T03:33:36.752843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3573","created_at":"2026-05-18T03:33:36.752843+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JDHBRO3JR3A","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JDHBRO3JR3AGESF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JDHBRO3","created_at":"2026-05-18T12:27:34.582898+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/5JDHBRO3JR3AGESFMK5VGBTGP7","json":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7.json","graph_json":"https://pith.science/api/pith-number/5JDHBRO3JR3AGESFMK5VGBTGP7/graph.json","events_json":"https://pith.science/api/pith-number/5JDHBRO3JR3AGESFMK5VGBTGP7/events.json","paper":"https://pith.science/paper/5JDHBRO3"},"agent_actions":{"view_html":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7","download_json":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7.json","view_paper":"https://pith.science/paper/5JDHBRO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3573&json=true","fetch_graph":"https://pith.science/api/pith-number/5JDHBRO3JR3AGESFMK5VGBTGP7/graph.json","fetch_events":"https://pith.science/api/pith-number/5JDHBRO3JR3AGESFMK5VGBTGP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7/action/storage_attestation","attest_author":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7/action/author_attestation","sign_citation":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7/action/citation_signature","submit_replication":"https://pith.science/pith/5JDHBRO3JR3AGESFMK5VGBTGP7/action/replication_record"}},"created_at":"2026-05-18T03:33:36.752843+00:00","updated_at":"2026-05-18T03:33:36.752843+00:00"}