{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OGPIKT4NN36YT5HRGD7RJGTVIW","short_pith_number":"pith:OGPIKT4N","schema_version":"1.0","canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","source":{"kind":"arxiv","id":"1009.0706","version":1},"attestation_state":"computed","paper":{"title":"On Complexity of Isoperimetric Problems on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Amir Daneshgar, Ramin Javadi","submitted_at":"2010-09-03T16:00:57Z","abstract_excerpt":"This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\\it minimum normalized cuts}/{\\it isoperimteric numbers} defined through taking minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a {\\it partition}/{\\it subpartition}. Following the main result of [A. Daneshgar, {\\it et. al.}, {\\it On the isoperimetric spectrum of graphs and its approximations}, JCTB, (2010)], it is known"},"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":"1009.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-03T16:00:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"cf0aee444b541a3b484f13f2cb592ecd98d22adb52ae803274b5fd007530fe18","abstract_canon_sha256":"35858c9266c37c26be4e077ebbc398404fe0f180b0a785eb4c07693cbba17900"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:25.512653Z","signature_b64":"3PxVtmBNombXwsdpYYxZuHKq3XoUT/a94ZtTaTrtMQxcyLkYvlzPl0sdio5PwC5ADCAEool2rxDB/6W2YRrWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","last_reissued_at":"2026-05-18T04:41:25.512203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:25.512203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Complexity of Isoperimetric Problems on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Amir Daneshgar, Ramin Javadi","submitted_at":"2010-09-03T16:00:57Z","abstract_excerpt":"This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\\it minimum normalized cuts}/{\\it isoperimteric numbers} defined through taking minimum of the maximum or the mean of the normalized outgoing flows from a set of subdomains of vertices, where these subdomains constitute a {\\it partition}/{\\it subpartition}. Following the main result of [A. Daneshgar, {\\it et. al.}, {\\it On the isoperimetric spectrum of graphs and its approximations}, JCTB, (2010)], it is known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0706","kind":"arxiv","version":1},"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":"1009.0706","created_at":"2026-05-18T04:41:25.512273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0706v1","created_at":"2026-05-18T04:41:25.512273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0706","created_at":"2026-05-18T04:41:25.512273+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGPIKT4NN36Y","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGPIKT4NN36YT5HR","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGPIKT4N","created_at":"2026-05-18T12:26:12.377268+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/OGPIKT4NN36YT5HRGD7RJGTVIW","json":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW.json","graph_json":"https://pith.science/api/pith-number/OGPIKT4NN36YT5HRGD7RJGTVIW/graph.json","events_json":"https://pith.science/api/pith-number/OGPIKT4NN36YT5HRGD7RJGTVIW/events.json","paper":"https://pith.science/paper/OGPIKT4N"},"agent_actions":{"view_html":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW","download_json":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW.json","view_paper":"https://pith.science/paper/OGPIKT4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0706&json=true","fetch_graph":"https://pith.science/api/pith-number/OGPIKT4NN36YT5HRGD7RJGTVIW/graph.json","fetch_events":"https://pith.science/api/pith-number/OGPIKT4NN36YT5HRGD7RJGTVIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/action/storage_attestation","attest_author":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/action/author_attestation","sign_citation":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/action/citation_signature","submit_replication":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/action/replication_record"}},"created_at":"2026-05-18T04:41:25.512273+00:00","updated_at":"2026-05-18T04:41:25.512273+00:00"}