{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2BVBLX2MP7CBSZMWPRZIKRHHJX","short_pith_number":"pith:2BVBLX2M","schema_version":"1.0","canonical_sha256":"d06a15df4c7fc41965967c728544e74dd0aadc948e3455da311b9fc183e611b0","source":{"kind":"arxiv","id":"1704.04509","version":1},"attestation_state":"computed","paper":{"title":"The Entropy of Backwards Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup","submitted_at":"2017-04-14T18:20:45Z","abstract_excerpt":"Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always maintain the Delauney triangulation of the points added thus far. For backwards analysis, we think of the permutation as generated backwards, implying that the $i$th point in the permutation is picked uniformly at random from the $i$ points not picked "},"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":"1704.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-14T18:20:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a9d3c73b56a1bb5f80530dfc2b604f45648a14ac692803d42c603253b220407","abstract_canon_sha256":"98abf826f0d6994998933e1cb8568fc7dfd553e79ce599f3424b5088cfe65510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.281692Z","signature_b64":"L/OZ3+dLq+InS2AHu8VbwyWgB+0k/CQ3qJzqxa9KmVoTyjrwB7eFxVF6RaAiW7nxwcaT4YlROXlWXcunOh9+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06a15df4c7fc41965967c728544e74dd0aadc948e3455da311b9fc183e611b0","last_reissued_at":"2026-05-18T00:46:18.281353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.281353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Entropy of Backwards Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Mikkel Thorup","submitted_at":"2017-04-14T18:20:45Z","abstract_excerpt":"Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always maintain the Delauney triangulation of the points added thus far. For backwards analysis, we think of the permutation as generated backwards, implying that the $i$th point in the permutation is picked uniformly at random from the $i$ points not picked "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04509","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":"1704.04509","created_at":"2026-05-18T00:46:18.281411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04509v1","created_at":"2026-05-18T00:46:18.281411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04509","created_at":"2026-05-18T00:46:18.281411+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BVBLX2MP7CB","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BVBLX2MP7CBSZMW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BVBLX2M","created_at":"2026-05-18T12:30:55.937587+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/2BVBLX2MP7CBSZMWPRZIKRHHJX","json":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX.json","graph_json":"https://pith.science/api/pith-number/2BVBLX2MP7CBSZMWPRZIKRHHJX/graph.json","events_json":"https://pith.science/api/pith-number/2BVBLX2MP7CBSZMWPRZIKRHHJX/events.json","paper":"https://pith.science/paper/2BVBLX2M"},"agent_actions":{"view_html":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX","download_json":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX.json","view_paper":"https://pith.science/paper/2BVBLX2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04509&json=true","fetch_graph":"https://pith.science/api/pith-number/2BVBLX2MP7CBSZMWPRZIKRHHJX/graph.json","fetch_events":"https://pith.science/api/pith-number/2BVBLX2MP7CBSZMWPRZIKRHHJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX/action/storage_attestation","attest_author":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX/action/author_attestation","sign_citation":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX/action/citation_signature","submit_replication":"https://pith.science/pith/2BVBLX2MP7CBSZMWPRZIKRHHJX/action/replication_record"}},"created_at":"2026-05-18T00:46:18.281411+00:00","updated_at":"2026-05-18T00:46:18.281411+00:00"}