{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SRIW47JZO7GTFJMUDI7ZZSEN7C","short_pith_number":"pith:SRIW47JZ","schema_version":"1.0","canonical_sha256":"94516e7d3977cd32a5941a3f9cc88df8ab4b3724bbec46ae3e606853b7a675f7","source":{"kind":"arxiv","id":"1112.3168","version":1},"attestation_state":"computed","paper":{"title":"A new approach to cross-bifix-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2011-12-14T11:13:08Z","abstract_excerpt":"Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable."},"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":"1112.3168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-14T11:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"41d4920357661a4bd664e7d87416d8a4b5b765621c89828f26c8839f88f6ddb5","abstract_canon_sha256":"a2ac6a8e0648a76239d07ed95df768bee29aea6eda0a0825435a520297ca9193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:19.953386Z","signature_b64":"QrsEtBlG/qoUuS13zwjqQN+meD3JEvT6aY+eyNt/Fz2We7AF0voxWOzELYsv74epttCPLBT90RZNKjL0rBecDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94516e7d3977cd32a5941a3f9cc88df8ab4b3724bbec46ae3e606853b7a675f7","last_reissued_at":"2026-05-18T04:06:19.952509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:19.952509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new approach to cross-bifix-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Elisa Pergola, Renzo Pinzani, Stefano Bilotta","submitted_at":"2011-12-14T11:13:08Z","abstract_excerpt":"Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3168","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":"1112.3168","created_at":"2026-05-18T04:06:19.952670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3168v1","created_at":"2026-05-18T04:06:19.952670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3168","created_at":"2026-05-18T04:06:19.952670+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRIW47JZO7GT","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRIW47JZO7GTFJMU","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRIW47JZ","created_at":"2026-05-18T12:26:41.206345+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/SRIW47JZO7GTFJMUDI7ZZSEN7C","json":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C.json","graph_json":"https://pith.science/api/pith-number/SRIW47JZO7GTFJMUDI7ZZSEN7C/graph.json","events_json":"https://pith.science/api/pith-number/SRIW47JZO7GTFJMUDI7ZZSEN7C/events.json","paper":"https://pith.science/paper/SRIW47JZ"},"agent_actions":{"view_html":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C","download_json":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C.json","view_paper":"https://pith.science/paper/SRIW47JZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3168&json=true","fetch_graph":"https://pith.science/api/pith-number/SRIW47JZO7GTFJMUDI7ZZSEN7C/graph.json","fetch_events":"https://pith.science/api/pith-number/SRIW47JZO7GTFJMUDI7ZZSEN7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C/action/storage_attestation","attest_author":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C/action/author_attestation","sign_citation":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C/action/citation_signature","submit_replication":"https://pith.science/pith/SRIW47JZO7GTFJMUDI7ZZSEN7C/action/replication_record"}},"created_at":"2026-05-18T04:06:19.952670+00:00","updated_at":"2026-05-18T04:06:19.952670+00:00"}