{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DHIO65J75RD7FACP2QC4UV55NA","short_pith_number":"pith:DHIO65J7","schema_version":"1.0","canonical_sha256":"19d0ef753fec47f2804fd405ca57bd681e14535431a188b25753d755039445e6","source":{"kind":"arxiv","id":"1307.6192","version":1},"attestation_state":"computed","paper":{"title":"Universal graphs and universal permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Alexandr Valyuzhenich, Sergey Kitaev, Vadim V. Lozin","submitted_at":"2013-07-23T19:00:53Z","abstract_excerpt":"Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$. Moreover, we say that $U^{(n)}$ is a proper $n$-universal graph for $X$ if it belongs to $X$. In the present paper, we construct a proper $n$-universal graph for the class of split permutation graphs. Our solution includes two ingredients: a proper universal 321-avoiding permutation and a bijection between 321-avoiding permutations and symmetric split permutation graphs. The $n$-universal split permutation graph co"},"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":"1307.6192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-23T19:00:53Z","cross_cats_sorted":[],"title_canon_sha256":"d6836dfc6fbb9731d8405c5540d39953c9181a722095eb288ffc5c5ff37247f6","abstract_canon_sha256":"8c8732d67783dc227c8ef17f0906cbdfd0cebc26cb21ae1d37cce03d274cad17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:45.105997Z","signature_b64":"p+RxAlS4z09A48JTXWl62U0XGnom7VYZTw3WkTqn5rocIi4uMAVUz8pDXkUlvwrGyRn8O44nvPqDMrPt/mxiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19d0ef753fec47f2804fd405ca57bd681e14535431a188b25753d755039445e6","last_reissued_at":"2026-05-18T03:17:45.105523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:45.105523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal graphs and universal permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aistis Atminas, Alexandr Valyuzhenich, Sergey Kitaev, Vadim V. Lozin","submitted_at":"2013-07-23T19:00:53Z","abstract_excerpt":"Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$. Moreover, we say that $U^{(n)}$ is a proper $n$-universal graph for $X$ if it belongs to $X$. In the present paper, we construct a proper $n$-universal graph for the class of split permutation graphs. Our solution includes two ingredients: a proper universal 321-avoiding permutation and a bijection between 321-avoiding permutations and symmetric split permutation graphs. The $n$-universal split permutation graph co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6192","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":"1307.6192","created_at":"2026-05-18T03:17:45.105587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6192v1","created_at":"2026-05-18T03:17:45.105587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6192","created_at":"2026-05-18T03:17:45.105587+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHIO65J75RD7","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHIO65J75RD7FACP","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHIO65J7","created_at":"2026-05-18T12:27:43.054852+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/DHIO65J75RD7FACP2QC4UV55NA","json":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA.json","graph_json":"https://pith.science/api/pith-number/DHIO65J75RD7FACP2QC4UV55NA/graph.json","events_json":"https://pith.science/api/pith-number/DHIO65J75RD7FACP2QC4UV55NA/events.json","paper":"https://pith.science/paper/DHIO65J7"},"agent_actions":{"view_html":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA","download_json":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA.json","view_paper":"https://pith.science/paper/DHIO65J7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6192&json=true","fetch_graph":"https://pith.science/api/pith-number/DHIO65J75RD7FACP2QC4UV55NA/graph.json","fetch_events":"https://pith.science/api/pith-number/DHIO65J75RD7FACP2QC4UV55NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA/action/storage_attestation","attest_author":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA/action/author_attestation","sign_citation":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA/action/citation_signature","submit_replication":"https://pith.science/pith/DHIO65J75RD7FACP2QC4UV55NA/action/replication_record"}},"created_at":"2026-05-18T03:17:45.105587+00:00","updated_at":"2026-05-18T03:17:45.105587+00:00"}