{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XB42TVJ7KTAXU6BIFANOXKCEHB","short_pith_number":"pith:XB42TVJ7","canonical_record":{"source":{"id":"2411.07705","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-11-12T10:43:42Z","cross_cats_sorted":[],"title_canon_sha256":"5aebfba15f592684ce3004e7fc0f489dea70a9eb5aed0c010d650ef8680d28a8","abstract_canon_sha256":"baf078c7a9aafabc7b563ce9aff69609438e57040729c8374461ed0422e88d2b"},"schema_version":"1.0"},"canonical_sha256":"b879a9d53f54c17a7828281aeba844385e6cba783f60dec9bf60c6088fe60b1d","source":{"kind":"arxiv","id":"2411.07705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.07705","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"2411.07705v1","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07705","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"XB42TVJ7KTAX","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_16","alias_value":"XB42TVJ7KTAXU6BI","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_8","alias_value":"XB42TVJ7","created_at":"2026-07-05T09:34:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XB42TVJ7KTAXU6BIFANOXKCEHB","target":"record","payload":{"canonical_record":{"source":{"id":"2411.07705","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-11-12T10:43:42Z","cross_cats_sorted":[],"title_canon_sha256":"5aebfba15f592684ce3004e7fc0f489dea70a9eb5aed0c010d650ef8680d28a8","abstract_canon_sha256":"baf078c7a9aafabc7b563ce9aff69609438e57040729c8374461ed0422e88d2b"},"schema_version":"1.0"},"canonical_sha256":"b879a9d53f54c17a7828281aeba844385e6cba783f60dec9bf60c6088fe60b1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:27.789895Z","signature_b64":"ZyOErXtJ37Yi0gLkQLEM0QPSrZlp3oSchOPeUSGJRsq2cGJaLTvj3aq7UExyY7NxkcWhTIkLqgMTkT/MjTEtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b879a9d53f54c17a7828281aeba844385e6cba783f60dec9bf60c6088fe60b1d","last_reissued_at":"2026-07-05T09:34:27.789481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:27.789481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.07705","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-05T09:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GhL5lUjnvh+9US6o3jjmWGlp8vjwd9X8GnIoIWfS1dQa5zpfrcSMRwyL6gJdFezxwYQsL+WjIernVRHr5i2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:40:56.340796Z"},"content_sha256":"57f160dec22fd7abef015e4864f2e5852bfb809589b12b7bf498c90bf0757bdd","schema_version":"1.0","event_id":"sha256:57f160dec22fd7abef015e4864f2e5852bfb809589b12b7bf498c90bf0757bdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XB42TVJ7KTAXU6BIFANOXKCEHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"dpvis: A Visual and Interactive Learning Tool for Dynamic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CY","authors_text":"Aditya Prasad, David H. Lee, David Kempe, Eric Han, Ramiro Deo-Campo Vuong, Tianyu Wang","submitted_at":"2024-11-12T10:43:42Z","abstract_excerpt":"Dynamic programming (DP) is a fundamental and powerful algorithmic paradigm taught in most undergraduate (and many graduate) algorithms classes. DP problems are challenging for many computer science students because they require identifying unique problem structures and a refined understanding of recursion. In this paper, we present dpvis, a Python library that helps students understand DP through a frame-by-frame animation of dynamic programs. dpvis can easily generate animations of dynamic programs with as little as two lines of modifications compared to a standard Python implementation. For"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07705","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/2411.07705/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-05T09:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KRtDIbpfFuefkLy1C9yrGSpGa9FG+G8n9QtSNy+rS+47HrOCeNap2MbniQJQeYzlFuoQ79JSGvD35JgfwubBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:40:56.341171Z"},"content_sha256":"93f5be0668ce1f7c5b221eb5e9d50e74d5115c30a65e4aa8e61e8a40f9df6109","schema_version":"1.0","event_id":"sha256:93f5be0668ce1f7c5b221eb5e9d50e74d5115c30a65e4aa8e61e8a40f9df6109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/bundle.json","state_url":"https://pith.science/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/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-07-07T11:40:56Z","links":{"resolver":"https://pith.science/pith/XB42TVJ7KTAXU6BIFANOXKCEHB","bundle":"https://pith.science/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/bundle.json","state":"https://pith.science/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XB42TVJ7KTAXU6BIFANOXKCEHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XB42TVJ7KTAXU6BIFANOXKCEHB","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":"baf078c7a9aafabc7b563ce9aff69609438e57040729c8374461ed0422e88d2b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-11-12T10:43:42Z","title_canon_sha256":"5aebfba15f592684ce3004e7fc0f489dea70a9eb5aed0c010d650ef8680d28a8"},"schema_version":"1.0","source":{"id":"2411.07705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.07705","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"2411.07705v1","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07705","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"XB42TVJ7KTAX","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_16","alias_value":"XB42TVJ7KTAXU6BI","created_at":"2026-07-05T09:34:27Z"},{"alias_kind":"pith_short_8","alias_value":"XB42TVJ7","created_at":"2026-07-05T09:34:27Z"}],"graph_snapshots":[{"event_id":"sha256:93f5be0668ce1f7c5b221eb5e9d50e74d5115c30a65e4aa8e61e8a40f9df6109","target":"graph","created_at":"2026-07-05T09:34:27Z","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/2411.07705/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic programming (DP) is a fundamental and powerful algorithmic paradigm taught in most undergraduate (and many graduate) algorithms classes. DP problems are challenging for many computer science students because they require identifying unique problem structures and a refined understanding of recursion. In this paper, we present dpvis, a Python library that helps students understand DP through a frame-by-frame animation of dynamic programs. dpvis can easily generate animations of dynamic programs with as little as two lines of modifications compared to a standard Python implementation. For","authors_text":"Aditya Prasad, David H. Lee, David Kempe, Eric Han, Ramiro Deo-Campo Vuong, Tianyu Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-11-12T10:43:42Z","title":"dpvis: A Visual and Interactive Learning Tool for Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07705","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:57f160dec22fd7abef015e4864f2e5852bfb809589b12b7bf498c90bf0757bdd","target":"record","created_at":"2026-07-05T09:34:27Z","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":"baf078c7a9aafabc7b563ce9aff69609438e57040729c8374461ed0422e88d2b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-11-12T10:43:42Z","title_canon_sha256":"5aebfba15f592684ce3004e7fc0f489dea70a9eb5aed0c010d650ef8680d28a8"},"schema_version":"1.0","source":{"id":"2411.07705","kind":"arxiv","version":1}},"canonical_sha256":"b879a9d53f54c17a7828281aeba844385e6cba783f60dec9bf60c6088fe60b1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b879a9d53f54c17a7828281aeba844385e6cba783f60dec9bf60c6088fe60b1d","first_computed_at":"2026-07-05T09:34:27.789481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:34:27.789481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZyOErXtJ37Yi0gLkQLEM0QPSrZlp3oSchOPeUSGJRsq2cGJaLTvj3aq7UExyY7NxkcWhTIkLqgMTkT/MjTEtBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:34:27.789895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.07705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57f160dec22fd7abef015e4864f2e5852bfb809589b12b7bf498c90bf0757bdd","sha256:93f5be0668ce1f7c5b221eb5e9d50e74d5115c30a65e4aa8e61e8a40f9df6109"],"state_sha256":"ca80f72a0d77586e230ee4eddbfeaa73e74bb3685cb54855dfa3bdca3719b257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9eNCT4JCKF4HP191eB3gR2neLBnI68rafmgkNowrNpgEVDXB8sjvj6V6Q74jGc/Y5A3ScdFLBjpKEowXdzlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:40:56.343048Z","bundle_sha256":"ee8bed69a83b0c4c89d66735df4f3fadeab26d8aaa986fb7c4746897f37ad01b"}}