{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:66W57ASJAM3RNTDRVSBLSNH3CS","short_pith_number":"pith:66W57ASJ","schema_version":"1.0","canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","source":{"kind":"arxiv","id":"1211.0328","version":3},"attestation_state":"computed","paper":{"title":"Some lower bounds for the $L$-intersection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Zeinab Maleki","submitted_at":"2012-11-01T23:47:21Z","abstract_excerpt":"For a set of non-negative integers $L$, the $L$-intersection number of a graph is the smallest number $l$ for which there is an assignment on the vertices to subsets $A_v \\subseteq \\{1,\\dots, l\\}$, such that every two vertices $u,v$ are adjacent if and only if $|A_u \\cap A_v|\\in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the vertices in different parts. In this paper, some lower bounds for the (bipartite) $L$-intersection number of a graph for various types $L$ in terms of the minimum rank of graph are obtained."},"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":"1211.0328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T23:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"c1d8192405680e1ce0e08a5b6863528c0b384d65dc809ae9c69ed6dcdc649989","abstract_canon_sha256":"714c8d7fa9a14736f29ffd9cc87fa03dc0be0e3e19e34d1ea76d39ac5cb8c733"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:32.530003Z","signature_b64":"52GCfOk2bLodQ/ajhQfg46ZnkrG37GpYxZj+4hgUdO7ovvNXBzEVv1oRLBsfThTiAe408puHQPEk1+UZ6bfjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","last_reissued_at":"2026-05-18T03:15:32.529559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:32.529559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some lower bounds for the $L$-intersection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Omoomi, Zeinab Maleki","submitted_at":"2012-11-01T23:47:21Z","abstract_excerpt":"For a set of non-negative integers $L$, the $L$-intersection number of a graph is the smallest number $l$ for which there is an assignment on the vertices to subsets $A_v \\subseteq \\{1,\\dots, l\\}$, such that every two vertices $u,v$ are adjacent if and only if $|A_u \\cap A_v|\\in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the vertices in different parts. In this paper, some lower bounds for the (bipartite) $L$-intersection number of a graph for various types $L$ in terms of the minimum rank of graph are obtained."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0328","kind":"arxiv","version":3},"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":"1211.0328","created_at":"2026-05-18T03:15:32.529623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0328v3","created_at":"2026-05-18T03:15:32.529623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0328","created_at":"2026-05-18T03:15:32.529623+00:00"},{"alias_kind":"pith_short_12","alias_value":"66W57ASJAM3R","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"66W57ASJAM3RNTDR","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"66W57ASJ","created_at":"2026-05-18T12:26:56.085431+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/66W57ASJAM3RNTDRVSBLSNH3CS","json":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS.json","graph_json":"https://pith.science/api/pith-number/66W57ASJAM3RNTDRVSBLSNH3CS/graph.json","events_json":"https://pith.science/api/pith-number/66W57ASJAM3RNTDRVSBLSNH3CS/events.json","paper":"https://pith.science/paper/66W57ASJ"},"agent_actions":{"view_html":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS","download_json":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS.json","view_paper":"https://pith.science/paper/66W57ASJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0328&json=true","fetch_graph":"https://pith.science/api/pith-number/66W57ASJAM3RNTDRVSBLSNH3CS/graph.json","fetch_events":"https://pith.science/api/pith-number/66W57ASJAM3RNTDRVSBLSNH3CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/action/storage_attestation","attest_author":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/action/author_attestation","sign_citation":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/action/citation_signature","submit_replication":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/action/replication_record"}},"created_at":"2026-05-18T03:15:32.529623+00:00","updated_at":"2026-05-18T03:15:32.529623+00:00"}