{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MMTXZS3NJ56DPBHYENEC25D6XL","short_pith_number":"pith:MMTXZS3N","canonical_record":{"source":{"id":"1209.3562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.LO","submitted_at":"2012-09-17T06:49:35Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"557a288e5731dc36ee75d38aafb072c47f938f58740fc149389cfa62af003250","abstract_canon_sha256":"82dcf1cd8d2b0010b9338e727b749e431a745b1a636d35a247fc433058ec0121"},"schema_version":"1.0"},"canonical_sha256":"63277ccb6d4f7c3784f823482d747ebac5a192198a6f01b26baf889768aec57a","source":{"kind":"arxiv","id":"1209.3562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3562","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3562v1","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3562","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"MMTXZS3NJ56D","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MMTXZS3NJ56DPBHY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MMTXZS3N","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MMTXZS3NJ56DPBHYENEC25D6XL","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.LO","submitted_at":"2012-09-17T06:49:35Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"557a288e5731dc36ee75d38aafb072c47f938f58740fc149389cfa62af003250","abstract_canon_sha256":"82dcf1cd8d2b0010b9338e727b749e431a745b1a636d35a247fc433058ec0121"},"schema_version":"1.0"},"canonical_sha256":"63277ccb6d4f7c3784f823482d747ebac5a192198a6f01b26baf889768aec57a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:30.628489Z","signature_b64":"obhLADOhHr6Ig24gieZgKfimgSeDyjIF1gmV04Jes+z/7E5aY7AnMXdtB4pNZKmWMwpFOSx925+O8CddEULjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63277ccb6d4f7c3784f823482d747ebac5a192198a6f01b26baf889768aec57a","last_reissued_at":"2026-05-18T03:45:30.628023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:30.628023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3562","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wJDPSO7JHUMJ9HChJNTcZHqrmuwl9tV8kb8bu8jKCS86E4vTEkNyFxc2lSJeJ2zYNzidZlh92TDVjbyUMIZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:07:41.800705Z"},"content_sha256":"b865ad9927d526c5e2b1d50310bfe17ccddb8964036eab6afb4823de8ea51223","schema_version":"1.0","event_id":"sha256:b865ad9927d526c5e2b1d50310bfe17ccddb8964036eab6afb4823de8ea51223"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MMTXZS3NJ56DPBHYENEC25D6XL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Knots, Braids and First Order Logic","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.LO","authors_text":"Siddhartha Gadgil, T. V. H. Prathamesh","submitted_at":"2012-09-17T06:49:35Z","abstract_excerpt":"Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic topological results.\n  Concretely, Knot theory is formulated in terms of a language with signature $(\\cdot,T,\\equiv, 1,\\sigma,\\bar\\sigma)$, with $\\cdot$ a 2-function, $T$ a 1-function, $\\equiv$ a 2-predicate and 1, $\\sigma$ and $\\bar\\sigma$ constants. We describe a finite set of axioms making the language into a (first order) theory. We show that every knot can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3562","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uG35skFM0s2j9uNmumJ8m0lNTnX71LVr8pAiuHIlKG8coSButoFCUdt7V6pC7HO8hfRhyDw68WP6FErTI8KBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:07:41.801047Z"},"content_sha256":"556566c3efbf92b34209b722bc1d227b91f7b374537203efd2ddd9edd4f4ab73","schema_version":"1.0","event_id":"sha256:556566c3efbf92b34209b722bc1d227b91f7b374537203efd2ddd9edd4f4ab73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMTXZS3NJ56DPBHYENEC25D6XL/bundle.json","state_url":"https://pith.science/pith/MMTXZS3NJ56DPBHYENEC25D6XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMTXZS3NJ56DPBHYENEC25D6XL/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-04T05:07:41Z","links":{"resolver":"https://pith.science/pith/MMTXZS3NJ56DPBHYENEC25D6XL","bundle":"https://pith.science/pith/MMTXZS3NJ56DPBHYENEC25D6XL/bundle.json","state":"https://pith.science/pith/MMTXZS3NJ56DPBHYENEC25D6XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMTXZS3NJ56DPBHYENEC25D6XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MMTXZS3NJ56DPBHYENEC25D6XL","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":"82dcf1cd8d2b0010b9338e727b749e431a745b1a636d35a247fc433058ec0121","cross_cats_sorted":["math.GT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.LO","submitted_at":"2012-09-17T06:49:35Z","title_canon_sha256":"557a288e5731dc36ee75d38aafb072c47f938f58740fc149389cfa62af003250"},"schema_version":"1.0","source":{"id":"1209.3562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3562","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3562v1","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3562","created_at":"2026-05-18T03:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"MMTXZS3NJ56D","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MMTXZS3NJ56DPBHY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MMTXZS3N","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:556566c3efbf92b34209b722bc1d227b91f7b374537203efd2ddd9edd4f4ab73","target":"graph","created_at":"2026-05-18T03:45:30Z","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":"Determining when two knots are equivalent (more precisely isotopic) is a fundamental problem in topology. Here we formulate this problem in terms of Predicate Calculus, using the formulation of knots in terms of braids and some basic topological results.\n  Concretely, Knot theory is formulated in terms of a language with signature $(\\cdot,T,\\equiv, 1,\\sigma,\\bar\\sigma)$, with $\\cdot$ a 2-function, $T$ a 1-function, $\\equiv$ a 2-predicate and 1, $\\sigma$ and $\\bar\\sigma$ constants. We describe a finite set of axioms making the language into a (first order) theory. We show that every knot can be","authors_text":"Siddhartha Gadgil, T. V. H. Prathamesh","cross_cats":["math.GT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.LO","submitted_at":"2012-09-17T06:49:35Z","title":"Knots, Braids and First Order Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3562","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:b865ad9927d526c5e2b1d50310bfe17ccddb8964036eab6afb4823de8ea51223","target":"record","created_at":"2026-05-18T03:45:30Z","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":"82dcf1cd8d2b0010b9338e727b749e431a745b1a636d35a247fc433058ec0121","cross_cats_sorted":["math.GT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.LO","submitted_at":"2012-09-17T06:49:35Z","title_canon_sha256":"557a288e5731dc36ee75d38aafb072c47f938f58740fc149389cfa62af003250"},"schema_version":"1.0","source":{"id":"1209.3562","kind":"arxiv","version":1}},"canonical_sha256":"63277ccb6d4f7c3784f823482d747ebac5a192198a6f01b26baf889768aec57a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63277ccb6d4f7c3784f823482d747ebac5a192198a6f01b26baf889768aec57a","first_computed_at":"2026-05-18T03:45:30.628023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:30.628023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"obhLADOhHr6Ig24gieZgKfimgSeDyjIF1gmV04Jes+z/7E5aY7AnMXdtB4pNZKmWMwpFOSx925+O8CddEULjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:30.628489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b865ad9927d526c5e2b1d50310bfe17ccddb8964036eab6afb4823de8ea51223","sha256:556566c3efbf92b34209b722bc1d227b91f7b374537203efd2ddd9edd4f4ab73"],"state_sha256":"d9bb91239441ecebf87a3eb8e73123a40478b4ea95790ac6a130ca1fc44d4fc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++x69AbKNcNe6FzLHHFJ7FNRpKe6AH8CAhIgPrfpl3bzb/UPM0yV3ppU0dIrtY8LZjbz/k1rPecz29PcMgRjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:07:41.802889Z","bundle_sha256":"fba099b839663b39743abd22e9a1461e19a8111462cd072d20a6ff2b03cfff5a"}}