{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OGPIKT4NN36YT5HRGD7RJGTVIW","short_pith_number":"pith:OGPIKT4N","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"},"canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","source":{"kind":"arxiv","id":"1009.0706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0706","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0706v1","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0706","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"OGPIKT4NN36Y","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OGPIKT4NN36YT5HR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OGPIKT4N","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OGPIKT4NN36YT5HRGD7RJGTVIW","target":"record","payload":{"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"},"canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","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"},"source_kind":"arxiv","source_id":"1009.0706","source_version":1,"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-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYDqKDvnzLM+hpvCbapV2rguV3t/p2JuBQz5loWZ/GPNFi/yso6bWYlRffyroUabKAjfySzpaREtCdLjVf8LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:01.069924Z"},"content_sha256":"63517fbd7cce6f273534f6ffdb6bce690cf0b3d4effaaad306450896d5c39857","schema_version":"1.0","event_id":"sha256:63517fbd7cce6f273534f6ffdb6bce690cf0b3d4effaaad306450896d5c39857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OGPIKT4NN36YT5HRGD7RJGTVIW","target":"graph","payload":{"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"},"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-18T04:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YywqaSajiituFLgh1VBdzEaQx0ZMHsZCDJVxxa7vBF4Z8sauuqx7v8AO1TkCqwTSGjY04YOVcVAkZGnKlLH0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:01.070270Z"},"content_sha256":"1d6d50c41e2a7641543efab901f258df3472f52be00e8011510bda98b5f31eb3","schema_version":"1.0","event_id":"sha256:1d6d50c41e2a7641543efab901f258df3472f52be00e8011510bda98b5f31eb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/bundle.json","state_url":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/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-02T21:40:01Z","links":{"resolver":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW","bundle":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/bundle.json","state":"https://pith.science/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGPIKT4NN36YT5HRGD7RJGTVIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OGPIKT4NN36YT5HRGD7RJGTVIW","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":"35858c9266c37c26be4e077ebbc398404fe0f180b0a785eb4c07693cbba17900","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-03T16:00:57Z","title_canon_sha256":"cf0aee444b541a3b484f13f2cb592ecd98d22adb52ae803274b5fd007530fe18"},"schema_version":"1.0","source":{"id":"1009.0706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.0706","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1009.0706v1","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0706","created_at":"2026-05-18T04:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"OGPIKT4NN36Y","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OGPIKT4NN36YT5HR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OGPIKT4N","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:1d6d50c41e2a7641543efab901f258df3472f52be00e8011510bda98b5f31eb3","target":"graph","created_at":"2026-05-18T04:41:25Z","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":"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","authors_text":"Amir Daneshgar, Ramin Javadi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-03T16:00:57Z","title":"On Complexity of Isoperimetric Problems on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0706","kind":"arxiv","version":1},"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:63517fbd7cce6f273534f6ffdb6bce690cf0b3d4effaaad306450896d5c39857","target":"record","created_at":"2026-05-18T04:41:25Z","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":"35858c9266c37c26be4e077ebbc398404fe0f180b0a785eb4c07693cbba17900","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-09-03T16:00:57Z","title_canon_sha256":"cf0aee444b541a3b484f13f2cb592ecd98d22adb52ae803274b5fd007530fe18"},"schema_version":"1.0","source":{"id":"1009.0706","kind":"arxiv","version":1}},"canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"719e854f8d6efd89f4f130ff149a75459f60b4dd726249d33278e35467ba86cd","first_computed_at":"2026-05-18T04:41:25.512203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:25.512203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3PxVtmBNombXwsdpYYxZuHKq3XoUT/a94ZtTaTrtMQxcyLkYvlzPl0sdio5PwC5ADCAEool2rxDB/6W2YRrWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:25.512653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.0706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63517fbd7cce6f273534f6ffdb6bce690cf0b3d4effaaad306450896d5c39857","sha256:1d6d50c41e2a7641543efab901f258df3472f52be00e8011510bda98b5f31eb3"],"state_sha256":"10290b47e620ac59d5d95a2ced470f3e1232ec091bcfcf6e0fdb5442bd6bdd28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AObjIr+/YAJdjwPpjgUraQ4g0XRvQZzjbmnn9ef1nC1wgqVaHLOAoK7KY0PBpTuLMBg1E9CF8WdT+W2DAMVhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:40:01.072268Z","bundle_sha256":"3327a801288f0b9e6c93b5714d1994e2dd09f122299da6f3c2d7e007de07d2a9"}}