{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PKKQ2DQGK7PRI5F4SW4BTZKH5N","short_pith_number":"pith:PKKQ2DQG","schema_version":"1.0","canonical_sha256":"7a950d0e0657df1474bc95b819e547eb50dd33e8993aeb9f62eceae25b8b109c","source":{"kind":"arxiv","id":"1308.1594","version":2},"attestation_state":"computed","paper":{"title":"A prime decomposition theorem for the 2-string link monoid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"John Burke, Robin Koytcheff, Ryan Blair","submitted_at":"2013-08-07T15:04:40Z","abstract_excerpt":"In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links to commute under the stacking operation."},"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":"1308.1594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2013-08-07T15:04:40Z","cross_cats_sorted":[],"title_canon_sha256":"393257197097ecc1122be9eb611e0bbd51002a71dda1c37bcf8d50b4aa72954a","abstract_canon_sha256":"f94e65539d806b59fe927b26b206bcfd35a0e47ca42b3c27b1a53a69621ea27b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.387843Z","signature_b64":"JeG0LR60BNdSrzM1X1JBEeRsIonzvJFgsO+JdOK+zWbj51jmYARSn3H0jkSdU60Jb1WvEvqcg12zFvdaz31iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a950d0e0657df1474bc95b819e547eb50dd33e8993aeb9f62eceae25b8b109c","last_reissued_at":"2026-05-18T00:30:34.387084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.387084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A prime decomposition theorem for the 2-string link monoid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"John Burke, Robin Koytcheff, Ryan Blair","submitted_at":"2013-08-07T15:04:40Z","abstract_excerpt":"In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links to commute under the stacking operation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1594","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":"1308.1594","created_at":"2026-05-18T00:30:34.387223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1594v2","created_at":"2026-05-18T00:30:34.387223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1594","created_at":"2026-05-18T00:30:34.387223+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKKQ2DQGK7PR","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKKQ2DQGK7PRI5F4","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKKQ2DQG","created_at":"2026-05-18T12:27:54.935989+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/PKKQ2DQGK7PRI5F4SW4BTZKH5N","json":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N.json","graph_json":"https://pith.science/api/pith-number/PKKQ2DQGK7PRI5F4SW4BTZKH5N/graph.json","events_json":"https://pith.science/api/pith-number/PKKQ2DQGK7PRI5F4SW4BTZKH5N/events.json","paper":"https://pith.science/paper/PKKQ2DQG"},"agent_actions":{"view_html":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N","download_json":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N.json","view_paper":"https://pith.science/paper/PKKQ2DQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1594&json=true","fetch_graph":"https://pith.science/api/pith-number/PKKQ2DQGK7PRI5F4SW4BTZKH5N/graph.json","fetch_events":"https://pith.science/api/pith-number/PKKQ2DQGK7PRI5F4SW4BTZKH5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N/action/storage_attestation","attest_author":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N/action/author_attestation","sign_citation":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N/action/citation_signature","submit_replication":"https://pith.science/pith/PKKQ2DQGK7PRI5F4SW4BTZKH5N/action/replication_record"}},"created_at":"2026-05-18T00:30:34.387223+00:00","updated_at":"2026-05-18T00:30:34.387223+00:00"}