{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:CN7ZDQ77OQI5MVDI2RBH5JNKWZ","short_pith_number":"pith:CN7ZDQ77","canonical_record":{"source":{"id":"cs/0011047","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2000-11-15T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"ffae72761d111ecb70627d8c3ddc34c924e6211c3e4877d30ef4649656df2493","abstract_canon_sha256":"371d0a5541f14a83bb004b183b28fea40e66d7a5303305c665554e01e4f83376"},"schema_version":"1.0"},"canonical_sha256":"137f91c3ff7411d65468d4427ea5aab66014c69773adee61780a0521f02dde02","source":{"kind":"arxiv","id":"cs/0011047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0011047","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0011047v1","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0011047","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"CN7ZDQ77OQI5","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_16","alias_value":"CN7ZDQ77OQI5MVDI","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_8","alias_value":"CN7ZDQ77","created_at":"2026-07-04T15:51:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:CN7ZDQ77OQI5MVDI2RBH5JNKWZ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0011047","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2000-11-15T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"ffae72761d111ecb70627d8c3ddc34c924e6211c3e4877d30ef4649656df2493","abstract_canon_sha256":"371d0a5541f14a83bb004b183b28fea40e66d7a5303305c665554e01e4f83376"},"schema_version":"1.0"},"canonical_sha256":"137f91c3ff7411d65468d4427ea5aab66014c69773adee61780a0521f02dde02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:51:19.377133Z","signature_b64":"bbIMfirrnQu3rh6xrkD/OHmTAUlEML1f4+zRBnbcdTUEgrMEcbX3Dq2y+RmOMC9kGhKdw8QrZ0Dl1tn5eya7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"137f91c3ff7411d65468d4427ea5aab66014c69773adee61780a0521f02dde02","last_reissued_at":"2026-07-04T15:51:19.376711Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:51:19.376711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0011047","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-04T15:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XqOC8D/7i7B4sNJ7NwPCDzvQC2H1+f/XBaaeK1mG0aT2LjA8Yjrs01ZArS8B6kBDTwZj6Dwv6aT/GVxhKZ+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:42:11.077107Z"},"content_sha256":"715ac1d1d7f1b89be8bfac2c6029486efb7103fa64eda2cb2907455f636bbfef","schema_version":"1.0","event_id":"sha256:715ac1d1d7f1b89be8bfac2c6029486efb7103fa64eda2cb2907455f636bbfef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:CN7ZDQ77OQI5MVDI2RBH5JNKWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dancing links","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Donald E. Knuth","submitted_at":"2000-11-15T00:00:00Z","abstract_excerpt":"The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes. The first trick is to implement each assumption of the search with reversible local operations on doubly linked lists. By this trick, every step of the search affects the data incrementally.\n  The second trick is to add a ghost square that represents the identity of each polyomino. Thus puts the rule that each polyomino be used once on the same footing as the rule that each square be covered once. The coding simplifies to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0011047","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/0011047/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-04T15:51:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCHP90Zei1HALRpQxBaJFV9UsS52ylgoraSoL+310aSQv4L5uPwHEFxgv6ffAFkeZFlfanehBtYiqOvqGQF/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T23:42:11.077609Z"},"content_sha256":"3b0b603ae75563282862e8c14f52d218ec66262fc8d712a36d80af78ee464bf8","schema_version":"1.0","event_id":"sha256:3b0b603ae75563282862e8c14f52d218ec66262fc8d712a36d80af78ee464bf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/bundle.json","state_url":"https://pith.science/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/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-21T23:42:11Z","links":{"resolver":"https://pith.science/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ","bundle":"https://pith.science/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/bundle.json","state":"https://pith.science/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CN7ZDQ77OQI5MVDI2RBH5JNKWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:CN7ZDQ77OQI5MVDI2RBH5JNKWZ","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":"371d0a5541f14a83bb004b183b28fea40e66d7a5303305c665554e01e4f83376","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2000-11-15T00:00:00Z","title_canon_sha256":"ffae72761d111ecb70627d8c3ddc34c924e6211c3e4877d30ef4649656df2493"},"schema_version":"1.0","source":{"id":"cs/0011047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0011047","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0011047v1","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0011047","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_12","alias_value":"CN7ZDQ77OQI5","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_16","alias_value":"CN7ZDQ77OQI5MVDI","created_at":"2026-07-04T15:51:19Z"},{"alias_kind":"pith_short_8","alias_value":"CN7ZDQ77","created_at":"2026-07-04T15:51:19Z"}],"graph_snapshots":[{"event_id":"sha256:3b0b603ae75563282862e8c14f52d218ec66262fc8d712a36d80af78ee464bf8","target":"graph","created_at":"2026-07-04T15:51:19Z","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/0011047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes. The first trick is to implement each assumption of the search with reversible local operations on doubly linked lists. By this trick, every step of the search affects the data incrementally.\n  The second trick is to add a ghost square that represents the identity of each polyomino. Thus puts the rule that each polyomino be used once on the same footing as the rule that each square be covered once. The coding simplifies to ","authors_text":"Donald E. Knuth","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2000-11-15T00:00:00Z","title":"Dancing links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0011047","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:715ac1d1d7f1b89be8bfac2c6029486efb7103fa64eda2cb2907455f636bbfef","target":"record","created_at":"2026-07-04T15:51:19Z","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":"371d0a5541f14a83bb004b183b28fea40e66d7a5303305c665554e01e4f83376","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2000-11-15T00:00:00Z","title_canon_sha256":"ffae72761d111ecb70627d8c3ddc34c924e6211c3e4877d30ef4649656df2493"},"schema_version":"1.0","source":{"id":"cs/0011047","kind":"arxiv","version":1}},"canonical_sha256":"137f91c3ff7411d65468d4427ea5aab66014c69773adee61780a0521f02dde02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"137f91c3ff7411d65468d4427ea5aab66014c69773adee61780a0521f02dde02","first_computed_at":"2026-07-04T15:51:19.376711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:51:19.376711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bbIMfirrnQu3rh6xrkD/OHmTAUlEML1f4+zRBnbcdTUEgrMEcbX3Dq2y+RmOMC9kGhKdw8QrZ0Dl1tn5eya7AQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:51:19.377133Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0011047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:715ac1d1d7f1b89be8bfac2c6029486efb7103fa64eda2cb2907455f636bbfef","sha256:3b0b603ae75563282862e8c14f52d218ec66262fc8d712a36d80af78ee464bf8"],"state_sha256":"8237612bf540f6d9a44f36d6f382eaadff83961fcee8344b51022df31ea99f79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/I8jDt91yF+FA2SECMt7j4uE1aIVhhELZDMosGgh67zR6qhOwsOTcm3dV5VdKagaTFbUde3GWC0Sy5gIYlLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T23:42:11.083152Z","bundle_sha256":"00d2f92e39f95a728d83497919ef98e852cce984802d0f99044d6035db78c0c6"}}