{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PARO6GKYHGNELEOLBSI3IBNHXU","short_pith_number":"pith:PARO6GKY","schema_version":"1.0","canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","source":{"kind":"arxiv","id":"2302.13713","version":1},"attestation_state":"computed","paper":{"title":"A notion of twins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zach Hunter","submitted_at":"2023-02-27T12:21:19Z","abstract_excerpt":"Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial structures. For example, given a graph $G$, one can ask what is the largest $s$ such that there exist disjoint subsets $I,J\\subset V(G)$ on $s$ vertices, such that the induced subgraphs $G[I],G[J]$ are isomorphic.\n  We are motivated by two different problems of finding twins in two kinds of ordered objects (strings and permutations). We introduce a new variant of `"},"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":"2302.13713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T12:21:19Z","cross_cats_sorted":[],"title_canon_sha256":"ad0441d3adfe60c9ba97c9c15fd141dcec4f5b27c39c8e394536d894aedd49d2","abstract_canon_sha256":"95c4e46f3ee68311b91724a612279c2d1721aa457560b2daa65e56c1aebcac00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:49.916954Z","signature_b64":"QIxBaKRnftjlVQJh8Hjr6KTZnF1M7KJCv2QYbPudBBfkYqyn+j/uxZA7xbhktAdNOKn4Ywc5V7ipOmsqKpbDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7822ef1958399a4591cb0c91b405a7bd35aed09208f20080df54842cbb8fb436","last_reissued_at":"2026-07-05T05:45:49.916499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:49.916499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A notion of twins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zach Hunter","submitted_at":"2023-02-27T12:21:19Z","abstract_excerpt":"Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial structures. For example, given a graph $G$, one can ask what is the largest $s$ such that there exist disjoint subsets $I,J\\subset V(G)$ on $s$ vertices, such that the induced subgraphs $G[I],G[J]$ are isomorphic.\n  We are motivated by two different problems of finding twins in two kinds of ordered objects (strings and permutations). We introduce a new variant of `"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13713","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.13713/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2302.13713","created_at":"2026-07-05T05:45:49.916555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13713v1","created_at":"2026-07-05T05:45:49.916555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13713","created_at":"2026-07-05T05:45:49.916555+00:00"},{"alias_kind":"pith_short_12","alias_value":"PARO6GKYHGNE","created_at":"2026-07-05T05:45:49.916555+00:00"},{"alias_kind":"pith_short_16","alias_value":"PARO6GKYHGNELEOL","created_at":"2026-07-05T05:45:49.916555+00:00"},{"alias_kind":"pith_short_8","alias_value":"PARO6GKY","created_at":"2026-07-05T05:45:49.916555+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08130","citing_title":"Selective Self-to-Supervised Fine-Tuning for Generalization in Large Language Models","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU","json":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU.json","graph_json":"https://pith.science/api/pith-number/PARO6GKYHGNELEOLBSI3IBNHXU/graph.json","events_json":"https://pith.science/api/pith-number/PARO6GKYHGNELEOLBSI3IBNHXU/events.json","paper":"https://pith.science/paper/PARO6GKY"},"agent_actions":{"view_html":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU","download_json":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU.json","view_paper":"https://pith.science/paper/PARO6GKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13713&json=true","fetch_graph":"https://pith.science/api/pith-number/PARO6GKYHGNELEOLBSI3IBNHXU/graph.json","fetch_events":"https://pith.science/api/pith-number/PARO6GKYHGNELEOLBSI3IBNHXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/action/storage_attestation","attest_author":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/action/author_attestation","sign_citation":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/action/citation_signature","submit_replication":"https://pith.science/pith/PARO6GKYHGNELEOLBSI3IBNHXU/action/replication_record"}},"created_at":"2026-07-05T05:45:49.916555+00:00","updated_at":"2026-07-05T05:45:49.916555+00:00"}