{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:66W57ASJAM3RNTDRVSBLSNH3CS","short_pith_number":"pith:66W57ASJ","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"},"canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","source":{"kind":"arxiv","id":"1211.0328","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0328","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0328v3","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0328","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"66W57ASJAM3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66W57ASJAM3RNTDR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66W57ASJ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:66W57ASJAM3RNTDRVSBLSNH3CS","target":"record","payload":{"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"},"canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","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"},"source_kind":"arxiv","source_id":"1211.0328","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7psQvFR8C1X2OynDm5msd+jIcOnuJXk+WSzoyVdBVzeEBd3ciE/MS9JJ/tuPp+Ys6JYdHwr4FtKhwqCpjy4TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:48:42.642561Z"},"content_sha256":"5539bdd3f3a817e570a664f41de31635b6f572efd17508ae272506ac2b73fca8","schema_version":"1.0","event_id":"sha256:5539bdd3f3a817e570a664f41de31635b6f572efd17508ae272506ac2b73fca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:66W57ASJAM3RNTDRVSBLSNH3CS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0D2RLMweNCJ2m9epHJLaWOMSDlI6KEodC018bKldu5BI9aZefU5/ZtOEXZXoJc8AJUz3eVD9k53XstMZFq15Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:48:42.643351Z"},"content_sha256":"4d68b399063506c7c97b06c8fe757679359a5994ae1b21bfb5317a55a3375963","schema_version":"1.0","event_id":"sha256:4d68b399063506c7c97b06c8fe757679359a5994ae1b21bfb5317a55a3375963"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/bundle.json","state_url":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66W57ASJAM3RNTDRVSBLSNH3CS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T06:48:42Z","links":{"resolver":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS","bundle":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/bundle.json","state":"https://pith.science/pith/66W57ASJAM3RNTDRVSBLSNH3CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66W57ASJAM3RNTDRVSBLSNH3CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:66W57ASJAM3RNTDRVSBLSNH3CS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"714c8d7fa9a14736f29ffd9cc87fa03dc0be0e3e19e34d1ea76d39ac5cb8c733","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T23:47:21Z","title_canon_sha256":"c1d8192405680e1ce0e08a5b6863528c0b384d65dc809ae9c69ed6dcdc649989"},"schema_version":"1.0","source":{"id":"1211.0328","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0328","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0328v3","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0328","created_at":"2026-05-18T03:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"66W57ASJAM3R","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66W57ASJAM3RNTDR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66W57ASJ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:4d68b399063506c7c97b06c8fe757679359a5994ae1b21bfb5317a55a3375963","target":"graph","created_at":"2026-05-18T03:15:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Behnaz Omoomi, Zeinab Maleki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T23:47:21Z","title":"Some lower bounds for the $L$-intersection number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0328","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5539bdd3f3a817e570a664f41de31635b6f572efd17508ae272506ac2b73fca8","target":"record","created_at":"2026-05-18T03:15:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"714c8d7fa9a14736f29ffd9cc87fa03dc0be0e3e19e34d1ea76d39ac5cb8c733","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T23:47:21Z","title_canon_sha256":"c1d8192405680e1ce0e08a5b6863528c0b384d65dc809ae9c69ed6dcdc649989"},"schema_version":"1.0","source":{"id":"1211.0328","kind":"arxiv","version":3}},"canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7addf8249033716cc71ac82b934fb14ba25c3b598cb93fd091de8add50a8b84","first_computed_at":"2026-05-18T03:15:32.529559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:32.529559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"52GCfOk2bLodQ/ajhQfg46ZnkrG37GpYxZj+4hgUdO7ovvNXBzEVv1oRLBsfThTiAe408puHQPEk1+UZ6bfjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:32.530003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0328","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5539bdd3f3a817e570a664f41de31635b6f572efd17508ae272506ac2b73fca8","sha256:4d68b399063506c7c97b06c8fe757679359a5994ae1b21bfb5317a55a3375963"],"state_sha256":"fc45c2a515f42c7f4a72e4df8a4c103ab369680b4ee6c30a80bddd2f285222a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWx485f8vasbXb97PIvBLbP4vW2O9h2nd5l3CoZCt9JSsI/NssoJe0d3SUKFUL1UAsPFpCUKZdzWID2x8SbbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:48:42.647830Z","bundle_sha256":"8a4a0a82788d0e28e7e9c2f96c57091a8c3b508d3b0039bc3082b46820ae40e6"}}