{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IBG3AMLUL3LYDKC3XVWTN6XQBN","short_pith_number":"pith:IBG3AMLU","canonical_record":{"source":{"id":"1312.5586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-12-19T15:28:23Z","cross_cats_sorted":["math.SG"],"title_canon_sha256":"372f7f3d2e314f6838fcbb8481e29c94b4807581d7a00116c92b48dc99091205","abstract_canon_sha256":"49ed1c99eda36a54c907c5d056922a8e334d91afe8ed839615518ca6d8192bce"},"schema_version":"1.0"},"canonical_sha256":"404db031745ed781a85bbd6d36faf00b731c6976ea7af5099ee128a0c09e713c","source":{"kind":"arxiv","id":"1312.5586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5586","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5586v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5586","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"IBG3AMLUL3LY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IBG3AMLUL3LYDKC3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IBG3AMLU","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IBG3AMLUL3LYDKC3XVWTN6XQBN","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-12-19T15:28:23Z","cross_cats_sorted":["math.SG"],"title_canon_sha256":"372f7f3d2e314f6838fcbb8481e29c94b4807581d7a00116c92b48dc99091205","abstract_canon_sha256":"49ed1c99eda36a54c907c5d056922a8e334d91afe8ed839615518ca6d8192bce"},"schema_version":"1.0"},"canonical_sha256":"404db031745ed781a85bbd6d36faf00b731c6976ea7af5099ee128a0c09e713c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:14.497976Z","signature_b64":"E7mnQY+BtuiyqwhHaahLiDL7mYTuV3LRKDLuMKYpivM6ZNRrtHWZC6pvbXTjPKY1JhnyOv1VJ8d3lrRz9n3MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"404db031745ed781a85bbd6d36faf00b731c6976ea7af5099ee128a0c09e713c","last_reissued_at":"2026-05-18T03:04:14.497540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:14.497540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5586","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-05-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+oDNd+Vi78FQHmUdJiKRK+kZX40jAk3DlxFGTPkk+euPwVjPg+a7gE1QyuxTUwwz+983DxY9NtQtNYRl6icCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:41:08.221107Z"},"content_sha256":"01c54043739c65af03c725e7589d5baf1fa2dfd219de869645344371af8cc587","schema_version":"1.0","event_id":"sha256:01c54043739c65af03c725e7589d5baf1fa2dfd219de869645344371af8cc587"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IBG3AMLUL3LYDKC3XVWTN6XQBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Braids and combinatorial knot Floer homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SG"],"primary_cat":"math.GT","authors_text":"David Shea Vela-Vick, Michaela Stone, Peter Lambert-Cole","submitted_at":"2013-12-19T15:28:23Z","abstract_excerpt":"We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\\xi_std), we associate a corresponding multi-pointed nice Heegaard diagram. We then describe an explicit algorithm for computing the associated knot Floer homology groups. We compute explicit bounds for the computational complexity of our algorithm and demonstrate that, in many cases, it is significantly faster than the previous approach using grid diagrams."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5586","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"},"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-05-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoMKN96Q4fg8+Lnb4lbXpOVbaMiNYTm3aXU0AQ1JYKMbFsZZrmpn8cEB6rQztLcjsPj3hia4w7cIvsBZQ9PhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:41:08.221691Z"},"content_sha256":"309bad65d53da0986253885dcd695bba6ade8db61f255ae88b315006c71a6059","schema_version":"1.0","event_id":"sha256:309bad65d53da0986253885dcd695bba6ade8db61f255ae88b315006c71a6059"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/bundle.json","state_url":"https://pith.science/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/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-06-07T05:41:08Z","links":{"resolver":"https://pith.science/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN","bundle":"https://pith.science/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/bundle.json","state":"https://pith.science/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBG3AMLUL3LYDKC3XVWTN6XQBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IBG3AMLUL3LYDKC3XVWTN6XQBN","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":"49ed1c99eda36a54c907c5d056922a8e334d91afe8ed839615518ca6d8192bce","cross_cats_sorted":["math.SG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-12-19T15:28:23Z","title_canon_sha256":"372f7f3d2e314f6838fcbb8481e29c94b4807581d7a00116c92b48dc99091205"},"schema_version":"1.0","source":{"id":"1312.5586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5586","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5586v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5586","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"IBG3AMLUL3LY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IBG3AMLUL3LYDKC3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IBG3AMLU","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:309bad65d53da0986253885dcd695bba6ade8db61f255ae88b315006c71a6059","target":"graph","created_at":"2026-05-18T03:04:14Z","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"},"paper":{"abstract_excerpt":"We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\\xi_std), we associate a corresponding multi-pointed nice Heegaard diagram. We then describe an explicit algorithm for computing the associated knot Floer homology groups. We compute explicit bounds for the computational complexity of our algorithm and demonstrate that, in many cases, it is significantly faster than the previous approach using grid diagrams.","authors_text":"David Shea Vela-Vick, Michaela Stone, Peter Lambert-Cole","cross_cats":["math.SG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-12-19T15:28:23Z","title":"Braids and combinatorial knot Floer homology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5586","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:01c54043739c65af03c725e7589d5baf1fa2dfd219de869645344371af8cc587","target":"record","created_at":"2026-05-18T03:04:14Z","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":"49ed1c99eda36a54c907c5d056922a8e334d91afe8ed839615518ca6d8192bce","cross_cats_sorted":["math.SG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-12-19T15:28:23Z","title_canon_sha256":"372f7f3d2e314f6838fcbb8481e29c94b4807581d7a00116c92b48dc99091205"},"schema_version":"1.0","source":{"id":"1312.5586","kind":"arxiv","version":1}},"canonical_sha256":"404db031745ed781a85bbd6d36faf00b731c6976ea7af5099ee128a0c09e713c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"404db031745ed781a85bbd6d36faf00b731c6976ea7af5099ee128a0c09e713c","first_computed_at":"2026-05-18T03:04:14.497540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:14.497540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E7mnQY+BtuiyqwhHaahLiDL7mYTuV3LRKDLuMKYpivM6ZNRrtHWZC6pvbXTjPKY1JhnyOv1VJ8d3lrRz9n3MCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:14.497976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01c54043739c65af03c725e7589d5baf1fa2dfd219de869645344371af8cc587","sha256:309bad65d53da0986253885dcd695bba6ade8db61f255ae88b315006c71a6059"],"state_sha256":"a7431c82d8e2e3a59279f66a3cf7b64daff37a6628c3a869e3cdb1a6074b10de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCTIV6gxMRQ6+hLUHdBagsLe1+DwLZb5Ro2LHU3bOCVl+s3hmr60LH8mTG5tYFHUXBjDKbZ8S0LExMhcmG1HBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:41:08.225375Z","bundle_sha256":"6d8e69c40bcd1fc29d1b4cd5afe00360a4b99201b0a12916f6fb6473dec43448"}}