{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ULRZE27W5LTSHESBP6A4R54PD6","short_pith_number":"pith:ULRZE27W","canonical_record":{"source":{"id":"1005.2211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-12T21:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"32417f7338a045078d294c530e43adc38f36f7ef6858eb1e2c4ba25953f2ccb0","abstract_canon_sha256":"93b2c9ccfabcd63f2a85ff59118be54635cb2a9a134a5709e62c76178e3a9044"},"schema_version":"1.0"},"canonical_sha256":"a2e3926bf6eae72392417f81c8f78f1fbe47018827499dcd274aef37f4459d8f","source":{"kind":"arxiv","id":"1005.2211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2211","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2211v1","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2211","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"ULRZE27W5LTS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"ULRZE27W5LTSHESB","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"ULRZE27W","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ULRZE27W5LTSHESBP6A4R54PD6","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-12T21:33:10Z","cross_cats_sorted":[],"title_canon_sha256":"32417f7338a045078d294c530e43adc38f36f7ef6858eb1e2c4ba25953f2ccb0","abstract_canon_sha256":"93b2c9ccfabcd63f2a85ff59118be54635cb2a9a134a5709e62c76178e3a9044"},"schema_version":"1.0"},"canonical_sha256":"a2e3926bf6eae72392417f81c8f78f1fbe47018827499dcd274aef37f4459d8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:12.936108Z","signature_b64":"zUPk+UXusDy0cEwKzExcmPyJZIkJPU8R7WQUdNpuXqG8LqQf1lcbsWPhwtIYjjnREyKqmC281ZRS1PtfbwEvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e3926bf6eae72392417f81c8f78f1fbe47018827499dcd274aef37f4459d8f","last_reissued_at":"2026-05-18T02:45:12.935606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:12.935606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2211","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-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sq4jDTVxSqSJRGbLBH9ZKRFCQIGxhUnd3pJjy/pvXAdvqTHVIGiu5DjM9DoDQ3koqC8MaWyeVg+w2rOtnWdKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:02.079567Z"},"content_sha256":"23ada46794990847f9eee622a2af471870402c38786f2db971c559d5267d4960","schema_version":"1.0","event_id":"sha256:23ada46794990847f9eee622a2af471870402c38786f2db971c559d5267d4960"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ULRZE27W5LTSHESBP6A4R54PD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arboricity, h-Index, and Dynamic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francisco J. Soulignac, Jayme L. Szwarcfiter, Min Chih Lin","submitted_at":"2010-05-12T21:33:10Z","abstract_excerpt":"In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure suitable for dynamic graph algorithms. We employ the data structure to formulate new algorithms for several problems, including counting subgraphs of four vertices, recognition of diamond-free graphs, cop-win graphs and strongly chordal graphs, among others. We improve the time complexity for graphs with low arboricity or h-index."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2211","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-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2buga4Ug6mhTZSmQeGCA5RTGOa73Hq2oLP7sh35EgZXbjhUQ3Sy2PA36Zn3hBV59Dz1bdQvC0lDhtlXcJYwKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:03:02.080189Z"},"content_sha256":"60f335b89c6466b4dd1ca2300891119faf73f4115f48dc44673ab7b341c0afc9","schema_version":"1.0","event_id":"sha256:60f335b89c6466b4dd1ca2300891119faf73f4115f48dc44673ab7b341c0afc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULRZE27W5LTSHESBP6A4R54PD6/bundle.json","state_url":"https://pith.science/pith/ULRZE27W5LTSHESBP6A4R54PD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULRZE27W5LTSHESBP6A4R54PD6/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-06T18:03:02Z","links":{"resolver":"https://pith.science/pith/ULRZE27W5LTSHESBP6A4R54PD6","bundle":"https://pith.science/pith/ULRZE27W5LTSHESBP6A4R54PD6/bundle.json","state":"https://pith.science/pith/ULRZE27W5LTSHESBP6A4R54PD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULRZE27W5LTSHESBP6A4R54PD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ULRZE27W5LTSHESBP6A4R54PD6","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":"93b2c9ccfabcd63f2a85ff59118be54635cb2a9a134a5709e62c76178e3a9044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-12T21:33:10Z","title_canon_sha256":"32417f7338a045078d294c530e43adc38f36f7ef6858eb1e2c4ba25953f2ccb0"},"schema_version":"1.0","source":{"id":"1005.2211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2211","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2211v1","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2211","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"ULRZE27W5LTS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"ULRZE27W5LTSHESB","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"ULRZE27W","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:60f335b89c6466b4dd1ca2300891119faf73f4115f48dc44673ab7b341c0afc9","target":"graph","created_at":"2026-05-18T02:45:12Z","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":"In this paper we present a modification of a technique by Chiba and Nishizeki [Chiba and Nishizeki: Arboricity and Subgraph Listing Algorithms, SIAM J. Comput. 14(1), pp. 210--223 (1985)]. Based on it, we design a data structure suitable for dynamic graph algorithms. We employ the data structure to formulate new algorithms for several problems, including counting subgraphs of four vertices, recognition of diamond-free graphs, cop-win graphs and strongly chordal graphs, among others. We improve the time complexity for graphs with low arboricity or h-index.","authors_text":"Francisco J. Soulignac, Jayme L. Szwarcfiter, Min Chih Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-12T21:33:10Z","title":"Arboricity, h-Index, and Dynamic Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2211","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:23ada46794990847f9eee622a2af471870402c38786f2db971c559d5267d4960","target":"record","created_at":"2026-05-18T02:45:12Z","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":"93b2c9ccfabcd63f2a85ff59118be54635cb2a9a134a5709e62c76178e3a9044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-05-12T21:33:10Z","title_canon_sha256":"32417f7338a045078d294c530e43adc38f36f7ef6858eb1e2c4ba25953f2ccb0"},"schema_version":"1.0","source":{"id":"1005.2211","kind":"arxiv","version":1}},"canonical_sha256":"a2e3926bf6eae72392417f81c8f78f1fbe47018827499dcd274aef37f4459d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e3926bf6eae72392417f81c8f78f1fbe47018827499dcd274aef37f4459d8f","first_computed_at":"2026-05-18T02:45:12.935606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:12.935606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zUPk+UXusDy0cEwKzExcmPyJZIkJPU8R7WQUdNpuXqG8LqQf1lcbsWPhwtIYjjnREyKqmC281ZRS1PtfbwEvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:12.936108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ada46794990847f9eee622a2af471870402c38786f2db971c559d5267d4960","sha256:60f335b89c6466b4dd1ca2300891119faf73f4115f48dc44673ab7b341c0afc9"],"state_sha256":"05b2b301821f888b39b7924c9deaf674a5762a1adeefcc91e5d75eaa28417d7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwYlubrXgAE+GEQzrpBH4T7GajlmOJEF8s5jW0bykvBpApp3RJAm8v99wwgiZtp76AboESxB5nvmP71wni9TAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:03:02.083041Z","bundle_sha256":"eca9b432f75eaec23e061f0e321c138e6b92e492ab484df95218c84bbcdf6971"}}