{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZF5DYCPSQVXBRJ7QAGXNQYF6DV","short_pith_number":"pith:ZF5DYCPS","schema_version":"1.0","canonical_sha256":"c97a3c09f2856e18a7f001aed860be1d4a11d14d7eca24792f595d543841e4be","source":{"kind":"arxiv","id":"1501.00580","version":2},"attestation_state":"computed","paper":{"title":"One-Term Parity Bracket For Braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Vassily Olegovich Manturov","submitted_at":"2015-01-03T17:14:41Z","abstract_excerpt":"In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is realized by diagram-valued invariants [ ] of knots such that [K]=K. It turns out that in the case of free braids, the same principle can be realized an unexpectedly easy way by a one-term invariant formula."},"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":"1501.00580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2015-01-03T17:14:41Z","cross_cats_sorted":[],"title_canon_sha256":"b55a0c5ff3d351567200ed687897f883430894c6d5da79eeaaeefda168189d86","abstract_canon_sha256":"66643d3e7fdb7896c1385e2c27e058af0f281d81a203c9507c13ab3764579e29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.112031Z","signature_b64":"Kvg1OOdJo+NJVCo6nBKmq9x5pn3DOnuPnuX5ouQsBhKl+yI6s56WBtFa7yMDge7TCRqRb/Bl+KKt2r0/pBa6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c97a3c09f2856e18a7f001aed860be1d4a11d14d7eca24792f595d543841e4be","last_reissued_at":"2026-05-18T02:28:13.111429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.111429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-Term Parity Bracket For Braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Vassily Olegovich Manturov","submitted_at":"2015-01-03T17:14:41Z","abstract_excerpt":"In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is realized by diagram-valued invariants [ ] of knots such that [K]=K. It turns out that in the case of free braids, the same principle can be realized an unexpectedly easy way by a one-term invariant formula."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00580","kind":"arxiv","version":2},"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":"1501.00580","created_at":"2026-05-18T02:28:13.111543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00580v2","created_at":"2026-05-18T02:28:13.111543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00580","created_at":"2026-05-18T02:28:13.111543+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZF5DYCPSQVXB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZF5DYCPSQVXBRJ7Q","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZF5DYCPS","created_at":"2026-05-18T12:29:52.810259+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/ZF5DYCPSQVXBRJ7QAGXNQYF6DV","json":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV.json","graph_json":"https://pith.science/api/pith-number/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/graph.json","events_json":"https://pith.science/api/pith-number/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/events.json","paper":"https://pith.science/paper/ZF5DYCPS"},"agent_actions":{"view_html":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV","download_json":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV.json","view_paper":"https://pith.science/paper/ZF5DYCPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00580&json=true","fetch_graph":"https://pith.science/api/pith-number/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/action/storage_attestation","attest_author":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/action/author_attestation","sign_citation":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/action/citation_signature","submit_replication":"https://pith.science/pith/ZF5DYCPSQVXBRJ7QAGXNQYF6DV/action/replication_record"}},"created_at":"2026-05-18T02:28:13.111543+00:00","updated_at":"2026-05-18T02:28:13.111543+00:00"}