{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KWDXRPI4J7EL2BJWIVTA2H5HRI","short_pith_number":"pith:KWDXRPI4","schema_version":"1.0","canonical_sha256":"558778bd1c4fc8bd053645660d1fa78a1337677cdf5c1dfcf96d16fa2c7a6443","source":{"kind":"arxiv","id":"1402.3582","version":1},"attestation_state":"computed","paper":{"title":"S-crucial and bicrucial permutations with respect to squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Konovalov, Ian Gent, Peter Nightingale, Sergey Kitaev, Steve Linton","submitted_at":"2014-02-14T20:49:01Z","abstract_excerpt":"A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to the left by any element gives a permutation that is not square-free.\n  Bicrucial permutations with respect to squares were studied by Avgustinovich et al., who proved that there exist bicrucial permutations of lengths $8k+1, 8k+5, 8k+7$ for $k\\ge 1$. It was left as open questions whether bicrucial permutations of even length, or such permutations of length $"},"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":"1402.3582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-14T20:49:01Z","cross_cats_sorted":[],"title_canon_sha256":"3bbee01f6846bcb5c797e2411308af24306efc44ad3cbc65825838cb5ab0ada6","abstract_canon_sha256":"6636645502722761446cc015c2954f11295f57760aaedc9f61f29a44b054548b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:58.392070Z","signature_b64":"9kwNFU5OkYLmVGX66vwynYnmKqExBX9J+YwveKr5JT0d+Mo/czSMZS96/R7C3Weu2HmFi95halx7v52aVYGcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"558778bd1c4fc8bd053645660d1fa78a1337677cdf5c1dfcf96d16fa2c7a6443","last_reissued_at":"2026-05-18T02:58:58.391146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:58.391146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"S-crucial and bicrucial permutations with respect to squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Konovalov, Ian Gent, Peter Nightingale, Sergey Kitaev, Steve Linton","submitted_at":"2014-02-14T20:49:01Z","abstract_excerpt":"A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to the left by any element gives a permutation that is not square-free.\n  Bicrucial permutations with respect to squares were studied by Avgustinovich et al., who proved that there exist bicrucial permutations of lengths $8k+1, 8k+5, 8k+7$ for $k\\ge 1$. It was left as open questions whether bicrucial permutations of even length, or such permutations of length $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3582","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":"1402.3582","created_at":"2026-05-18T02:58:58.391312+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3582v1","created_at":"2026-05-18T02:58:58.391312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3582","created_at":"2026-05-18T02:58:58.391312+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWDXRPI4J7EL","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWDXRPI4J7EL2BJW","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWDXRPI4","created_at":"2026-05-18T12:28:35.611951+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/KWDXRPI4J7EL2BJWIVTA2H5HRI","json":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI.json","graph_json":"https://pith.science/api/pith-number/KWDXRPI4J7EL2BJWIVTA2H5HRI/graph.json","events_json":"https://pith.science/api/pith-number/KWDXRPI4J7EL2BJWIVTA2H5HRI/events.json","paper":"https://pith.science/paper/KWDXRPI4"},"agent_actions":{"view_html":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI","download_json":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI.json","view_paper":"https://pith.science/paper/KWDXRPI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3582&json=true","fetch_graph":"https://pith.science/api/pith-number/KWDXRPI4J7EL2BJWIVTA2H5HRI/graph.json","fetch_events":"https://pith.science/api/pith-number/KWDXRPI4J7EL2BJWIVTA2H5HRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI/action/storage_attestation","attest_author":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI/action/author_attestation","sign_citation":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI/action/citation_signature","submit_replication":"https://pith.science/pith/KWDXRPI4J7EL2BJWIVTA2H5HRI/action/replication_record"}},"created_at":"2026-05-18T02:58:58.391312+00:00","updated_at":"2026-05-18T02:58:58.391312+00:00"}