{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QE6OH4ERAATNNWILDOISROPYCD","short_pith_number":"pith:QE6OH4ER","schema_version":"1.0","canonical_sha256":"813ce3f0910026d6d90b1b9128b9f810fb0b2b5fae789913a7f500a7ba381f0f","source":{"kind":"arxiv","id":"1510.08779","version":4},"attestation_state":"computed","paper":{"title":"Effect of Gromov-hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Farzaneh Yahyanejad, Marek Karpinski, Nasim Mobasheri","submitted_at":"2015-10-29T16:56:12Z","abstract_excerpt":"$\\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of \"non-expander\" graphs. The main motivation of this paper is to investigate the effect of the hyperbolicity measure $\\delta$ on expansion and cut-size bounds on graphs (here $\\delta$ need not be a constant), and the asymptotic ranges of $\\delta$ for which these results may provide improved approximation algorithms for related combinatorial problems. To this effect, we provi"},"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":"1510.08779","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-29T16:56:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"05d189bd501ca8c15d5fa92df10e9a2caf73885085697f5ae4ee2302d51e9b27","abstract_canon_sha256":"1453c40d2e67feec98d92bdf2cde736f757ee0faa78d2aeb1d03cd56fabb7371"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.852863Z","signature_b64":"oundjPCviGYKqpDlsPSGxJWk602+tkapk+9/Zjk2UoV5+Kjno5YquEwIo8K7bMLnDuHA290ePQTf9C1IyOtFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"813ce3f0910026d6d90b1b9128b9f810fb0b2b5fae789913a7f500a7ba381f0f","last_reissued_at":"2026-05-18T00:07:55.852182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.852182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effect of Gromov-hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Farzaneh Yahyanejad, Marek Karpinski, Nasim Mobasheri","submitted_at":"2015-10-29T16:56:12Z","abstract_excerpt":"$\\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of \"non-expander\" graphs. The main motivation of this paper is to investigate the effect of the hyperbolicity measure $\\delta$ on expansion and cut-size bounds on graphs (here $\\delta$ need not be a constant), and the asymptotic ranges of $\\delta$ for which these results may provide improved approximation algorithms for related combinatorial problems. To this effect, we provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08779","kind":"arxiv","version":4},"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":"1510.08779","created_at":"2026-05-18T00:07:55.852294+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08779v4","created_at":"2026-05-18T00:07:55.852294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08779","created_at":"2026-05-18T00:07:55.852294+00:00"},{"alias_kind":"pith_short_12","alias_value":"QE6OH4ERAATN","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QE6OH4ERAATNNWIL","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QE6OH4ER","created_at":"2026-05-18T12:29:37.295048+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/QE6OH4ERAATNNWILDOISROPYCD","json":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD.json","graph_json":"https://pith.science/api/pith-number/QE6OH4ERAATNNWILDOISROPYCD/graph.json","events_json":"https://pith.science/api/pith-number/QE6OH4ERAATNNWILDOISROPYCD/events.json","paper":"https://pith.science/paper/QE6OH4ER"},"agent_actions":{"view_html":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD","download_json":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD.json","view_paper":"https://pith.science/paper/QE6OH4ER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08779&json=true","fetch_graph":"https://pith.science/api/pith-number/QE6OH4ERAATNNWILDOISROPYCD/graph.json","fetch_events":"https://pith.science/api/pith-number/QE6OH4ERAATNNWILDOISROPYCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD/action/storage_attestation","attest_author":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD/action/author_attestation","sign_citation":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD/action/citation_signature","submit_replication":"https://pith.science/pith/QE6OH4ERAATNNWILDOISROPYCD/action/replication_record"}},"created_at":"2026-05-18T00:07:55.852294+00:00","updated_at":"2026-05-18T00:07:55.852294+00:00"}