{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KF3Y27FAD4ZVOK5BRIYGXPO7GE","short_pith_number":"pith:KF3Y27FA","schema_version":"1.0","canonical_sha256":"51778d7ca01f33572ba18a306bbddf31044637785cfb0f1bb7714d2ef417a819","source":{"kind":"arxiv","id":"2411.03274","version":1},"attestation_state":"computed","paper":{"title":"Generalized Word-Representable Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Henning Fernau, Kevin Mann, Pamela Fleischmann, Silas Cato Sacher, Zhidan Feng","submitted_at":"2024-11-05T17:17:30Z","abstract_excerpt":"The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our framework, we can associate a graph class to each language over the binary alphabet \\{0,1\\}. All graph classes that are language-representable in this sense are hereditary and enjoy further common properties. Besides word-representable graphs and, more generally, 1^k- or k-11-representable graphs, we can identify many more graph classes in our framework, like "},"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":"2411.03274","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2024-11-05T17:17:30Z","cross_cats_sorted":[],"title_canon_sha256":"a529cc058fe2a1b901166ba818cb9d9a18ec5dc1a9dcc23dad50254ace9e0984","abstract_canon_sha256":"e9b6057f6f506a5e6536cfc92ecacad44ca77d87da322905c3b03b7cbad7aafb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:27.800897Z","signature_b64":"p5U6vtz89sAUK0t7LD1GKM1mSpYlZDTYt8I7t2pw2M3U4gK30B3oWl7j0QtGqkuCVq/RJ9LQx7f4qYGV20a3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51778d7ca01f33572ba18a306bbddf31044637785cfb0f1bb7714d2ef417a819","last_reissued_at":"2026-07-05T09:31:27.800449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:27.800449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Word-Representable Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Henning Fernau, Kevin Mann, Pamela Fleischmann, Silas Cato Sacher, Zhidan Feng","submitted_at":"2024-11-05T17:17:30Z","abstract_excerpt":"The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our framework, we can associate a graph class to each language over the binary alphabet \\{0,1\\}. All graph classes that are language-representable in this sense are hereditary and enjoy further common properties. Besides word-representable graphs and, more generally, 1^k- or k-11-representable graphs, we can identify many more graph classes in our framework, like "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03274","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/2411.03274/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":"2411.03274","created_at":"2026-07-05T09:31:27.800498+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03274v1","created_at":"2026-07-05T09:31:27.800498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03274","created_at":"2026-07-05T09:31:27.800498+00:00"},{"alias_kind":"pith_short_12","alias_value":"KF3Y27FAD4ZV","created_at":"2026-07-05T09:31:27.800498+00:00"},{"alias_kind":"pith_short_16","alias_value":"KF3Y27FAD4ZVOK5B","created_at":"2026-07-05T09:31:27.800498+00:00"},{"alias_kind":"pith_short_8","alias_value":"KF3Y27FA","created_at":"2026-07-05T09:31:27.800498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07496","citing_title":"Exploring Word-Representable Temporal Graphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE","json":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE.json","graph_json":"https://pith.science/api/pith-number/KF3Y27FAD4ZVOK5BRIYGXPO7GE/graph.json","events_json":"https://pith.science/api/pith-number/KF3Y27FAD4ZVOK5BRIYGXPO7GE/events.json","paper":"https://pith.science/paper/KF3Y27FA"},"agent_actions":{"view_html":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE","download_json":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE.json","view_paper":"https://pith.science/paper/KF3Y27FA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03274&json=true","fetch_graph":"https://pith.science/api/pith-number/KF3Y27FAD4ZVOK5BRIYGXPO7GE/graph.json","fetch_events":"https://pith.science/api/pith-number/KF3Y27FAD4ZVOK5BRIYGXPO7GE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE/action/storage_attestation","attest_author":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE/action/author_attestation","sign_citation":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE/action/citation_signature","submit_replication":"https://pith.science/pith/KF3Y27FAD4ZVOK5BRIYGXPO7GE/action/replication_record"}},"created_at":"2026-07-05T09:31:27.800498+00:00","updated_at":"2026-07-05T09:31:27.800498+00:00"}