{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HL3ZN4HZWVPZRBAAYNIOIHDAHV","short_pith_number":"pith:HL3ZN4HZ","schema_version":"1.0","canonical_sha256":"3af796f0f9b55f988400c350e41c603d5f5dc8dd815488b6f58efb2a17efa244","source":{"kind":"arxiv","id":"1001.3661","version":2},"attestation_state":"computed","paper":{"title":"Tight products and Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amit Daniely, Nathan Linial","submitted_at":"2010-01-20T20:14:15Z","abstract_excerpt":"In this paper we study a new product of graphs called {\\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\\times V(G_2)$ and both projection maps $V(H)\\to V(G_1)$ and $V(H)\\to V(G_2)$ are covering maps. It is not a priori clear when two given graphs have a tight product (in fact, it is $NP$-hard to decide). We investigate the conditions under which this is possible. This perspective yields a new characterization of class-1 $(2k+1)$-regular graphs. We also obtain a new model of random $d$-regular graphs whose second eig"},"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":"1001.3661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-01-20T20:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"120a0c9ca1cfe19af35004785bee3bae26bc30157571e4d4e41b3147b5b80eb2","abstract_canon_sha256":"da1046cb4572db88bd3b915932b3715ccdd057b40eaaeabfd88473a5321600bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:40.587162Z","signature_b64":"+YcYaPBZl/Qyv9pVn480liFypiH0YNO2EaMfaxQ5D8Hz1HfPzDfY2AKGfq8HaSK0VB1P9fUv6/PL8Sa9bS+LDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3af796f0f9b55f988400c350e41c603d5f5dc8dd815488b6f58efb2a17efa244","last_reissued_at":"2026-05-18T03:41:40.586244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:40.586244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight products and Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Amit Daniely, Nathan Linial","submitted_at":"2010-01-20T20:14:15Z","abstract_excerpt":"In this paper we study a new product of graphs called {\\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\\times V(G_2)$ and both projection maps $V(H)\\to V(G_1)$ and $V(H)\\to V(G_2)$ are covering maps. It is not a priori clear when two given graphs have a tight product (in fact, it is $NP$-hard to decide). We investigate the conditions under which this is possible. This perspective yields a new characterization of class-1 $(2k+1)$-regular graphs. We also obtain a new model of random $d$-regular graphs whose second eig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3661","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":"1001.3661","created_at":"2026-05-18T03:41:40.586397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3661v2","created_at":"2026-05-18T03:41:40.586397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3661","created_at":"2026-05-18T03:41:40.586397+00:00"},{"alias_kind":"pith_short_12","alias_value":"HL3ZN4HZWVPZ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HL3ZN4HZWVPZRBAA","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HL3ZN4HZ","created_at":"2026-05-18T12:26:07.630475+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/HL3ZN4HZWVPZRBAAYNIOIHDAHV","json":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV.json","graph_json":"https://pith.science/api/pith-number/HL3ZN4HZWVPZRBAAYNIOIHDAHV/graph.json","events_json":"https://pith.science/api/pith-number/HL3ZN4HZWVPZRBAAYNIOIHDAHV/events.json","paper":"https://pith.science/paper/HL3ZN4HZ"},"agent_actions":{"view_html":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV","download_json":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV.json","view_paper":"https://pith.science/paper/HL3ZN4HZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3661&json=true","fetch_graph":"https://pith.science/api/pith-number/HL3ZN4HZWVPZRBAAYNIOIHDAHV/graph.json","fetch_events":"https://pith.science/api/pith-number/HL3ZN4HZWVPZRBAAYNIOIHDAHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV/action/storage_attestation","attest_author":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV/action/author_attestation","sign_citation":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV/action/citation_signature","submit_replication":"https://pith.science/pith/HL3ZN4HZWVPZRBAAYNIOIHDAHV/action/replication_record"}},"created_at":"2026-05-18T03:41:40.586397+00:00","updated_at":"2026-05-18T03:41:40.586397+00:00"}