{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z5TI6MB2H4RJQXA2YJBN2XKKJS","short_pith_number":"pith:Z5TI6MB2","schema_version":"1.0","canonical_sha256":"cf668f303a3f22985c1ac242dd5d4a4c890f9470dd48c7a8f0aeeaa813ef0831","source":{"kind":"arxiv","id":"1309.0170","version":2},"attestation_state":"computed","paper":{"title":"Set Representations of Linegraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Lin Guo, Tao-Ming Wang, Ton Kloks, Yue-Li Wang","submitted_at":"2013-09-01T00:50:58Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A family $\\mathcal{S}$ of nonempty sets $\\{S_1,\\ldots,S_n\\}$ is a set representation of $G$ if there exists a one-to-one correspondence between the vertices $v_1, \\ldots, v_n$ in $V(G)$ and the sets in $\\mathcal{S}$ such that $v_iv_j \\in E(G)$ if and only if $S_i\\cap S_j\\neq \\es$. A set representation $\\mathcal{S}$ is a distinct (respectively, antichain, uniform and simple) set representation if any two sets $S_i$ and $S_j$ in $\\mathcal{S}$ have the property $S_i\\neq S_j$ (respectively, $S_i\\nsubseteq S_j$, $|S_i|=|S_j|$ and $|S_i\\"},"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":"1309.0170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-01T00:50:58Z","cross_cats_sorted":[],"title_canon_sha256":"2c83a872d2c93a35c2e1df4fb929f2ec2d1a623a356eccefe165ef8cacf12d44","abstract_canon_sha256":"536da66496e15ea069009116622c58582a2d8729c23ce52d47e848d072b98b02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:18.873427Z","signature_b64":"6oSUki4FkF3CS0qsTadt/2yoyIk8jrg6/pjwxdfv22w/qY0Des6Qu8sGw/f9540sm3XLfKK42JmDQRzydb2oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf668f303a3f22985c1ac242dd5d4a4c890f9470dd48c7a8f0aeeaa813ef0831","last_reissued_at":"2026-05-18T03:14:18.872861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:18.872861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Representations of Linegraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun-Lin Guo, Tao-Ming Wang, Ton Kloks, Yue-Li Wang","submitted_at":"2013-09-01T00:50:58Z","abstract_excerpt":"Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A family $\\mathcal{S}$ of nonempty sets $\\{S_1,\\ldots,S_n\\}$ is a set representation of $G$ if there exists a one-to-one correspondence between the vertices $v_1, \\ldots, v_n$ in $V(G)$ and the sets in $\\mathcal{S}$ such that $v_iv_j \\in E(G)$ if and only if $S_i\\cap S_j\\neq \\es$. A set representation $\\mathcal{S}$ is a distinct (respectively, antichain, uniform and simple) set representation if any two sets $S_i$ and $S_j$ in $\\mathcal{S}$ have the property $S_i\\neq S_j$ (respectively, $S_i\\nsubseteq S_j$, $|S_i|=|S_j|$ and $|S_i\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0170","kind":"arxiv","version":2},"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":"1309.0170","created_at":"2026-05-18T03:14:18.872951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.0170v2","created_at":"2026-05-18T03:14:18.872951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0170","created_at":"2026-05-18T03:14:18.872951+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5TI6MB2H4RJ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5TI6MB2H4RJQXA2","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5TI6MB2","created_at":"2026-05-18T12:28:09.283467+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/Z5TI6MB2H4RJQXA2YJBN2XKKJS","json":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS.json","graph_json":"https://pith.science/api/pith-number/Z5TI6MB2H4RJQXA2YJBN2XKKJS/graph.json","events_json":"https://pith.science/api/pith-number/Z5TI6MB2H4RJQXA2YJBN2XKKJS/events.json","paper":"https://pith.science/paper/Z5TI6MB2"},"agent_actions":{"view_html":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS","download_json":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS.json","view_paper":"https://pith.science/paper/Z5TI6MB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.0170&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5TI6MB2H4RJQXA2YJBN2XKKJS/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5TI6MB2H4RJQXA2YJBN2XKKJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS/action/storage_attestation","attest_author":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS/action/author_attestation","sign_citation":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS/action/citation_signature","submit_replication":"https://pith.science/pith/Z5TI6MB2H4RJQXA2YJBN2XKKJS/action/replication_record"}},"created_at":"2026-05-18T03:14:18.872951+00:00","updated_at":"2026-05-18T03:14:18.872951+00:00"}