{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NNTTJK77YHQGOXNYY4NYJJ2767","short_pith_number":"pith:NNTTJK77","schema_version":"1.0","canonical_sha256":"6b6734abffc1e0675db8c71b84a75ff7edfc5131e93efa36996718de203b7a36","source":{"kind":"arxiv","id":"1308.4186","version":1},"attestation_state":"computed","paper":{"title":"A 2-chain can interlock with an open 10-chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bin Lu, Jianyuan K. Zhong, Joseph O'Rourke","submitted_at":"2013-08-19T22:36:04Z","abstract_excerpt":"It is an open problem, posed in \\cite{SoCG}, to determine the minimal $k$ such that an open flexible $k$-chain can interlock with a flexible 2-chain. It was first established in \\cite{GLOSZ} that there is an open 16-chain in a trapezoid frame that achieves interlocking. This was subsequently improved in \\cite{GLOZ} to establish interlocking between a 2-chain and an open 11-chain. Here we improve that result once more, establishing interlocking between a 2-chain and a 10-chain. We present arguments that indicate that 10 is likely the minimum."},"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.4186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-19T22:36:04Z","cross_cats_sorted":[],"title_canon_sha256":"e9ab4cb9333a4640d703148d0e5530f0753ef1b6315744019e49c874792836ef","abstract_canon_sha256":"76b9692fe35ae745c0d02903b4941c1fb29631e92a5b6b792dd29986ed0190a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.528778Z","signature_b64":"3n+gSlFUr1LZ9epbByC6JoWzI/dyWxu0xui7azKn/FLM3dNrNbxCaIHRtKjqib4VRD6yOc524v2FZpQ33hEEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b6734abffc1e0675db8c71b84a75ff7edfc5131e93efa36996718de203b7a36","last_reissued_at":"2026-05-18T03:15:33.528240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.528240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2-chain can interlock with an open 10-chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bin Lu, Jianyuan K. Zhong, Joseph O'Rourke","submitted_at":"2013-08-19T22:36:04Z","abstract_excerpt":"It is an open problem, posed in \\cite{SoCG}, to determine the minimal $k$ such that an open flexible $k$-chain can interlock with a flexible 2-chain. It was first established in \\cite{GLOSZ} that there is an open 16-chain in a trapezoid frame that achieves interlocking. This was subsequently improved in \\cite{GLOZ} to establish interlocking between a 2-chain and an open 11-chain. Here we improve that result once more, establishing interlocking between a 2-chain and a 10-chain. We present arguments that indicate that 10 is likely the minimum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4186","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.4186","created_at":"2026-05-18T03:15:33.528331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4186v1","created_at":"2026-05-18T03:15:33.528331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4186","created_at":"2026-05-18T03:15:33.528331+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNTTJK77YHQG","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNTTJK77YHQGOXNY","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNTTJK77","created_at":"2026-05-18T12:27:52.871228+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/NNTTJK77YHQGOXNYY4NYJJ2767","json":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767.json","graph_json":"https://pith.science/api/pith-number/NNTTJK77YHQGOXNYY4NYJJ2767/graph.json","events_json":"https://pith.science/api/pith-number/NNTTJK77YHQGOXNYY4NYJJ2767/events.json","paper":"https://pith.science/paper/NNTTJK77"},"agent_actions":{"view_html":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767","download_json":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767.json","view_paper":"https://pith.science/paper/NNTTJK77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4186&json=true","fetch_graph":"https://pith.science/api/pith-number/NNTTJK77YHQGOXNYY4NYJJ2767/graph.json","fetch_events":"https://pith.science/api/pith-number/NNTTJK77YHQGOXNYY4NYJJ2767/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767/action/storage_attestation","attest_author":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767/action/author_attestation","sign_citation":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767/action/citation_signature","submit_replication":"https://pith.science/pith/NNTTJK77YHQGOXNYY4NYJJ2767/action/replication_record"}},"created_at":"2026-05-18T03:15:33.528331+00:00","updated_at":"2026-05-18T03:15:33.528331+00:00"}