{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Y3GWTLUZBQFSHFXW7Y6GFAJ5PU","short_pith_number":"pith:Y3GWTLUZ","canonical_record":{"source":{"id":"1306.2096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-06-10T03:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"03df80c02b9e85accc42aecc698a06d3406bf6b48dc2b5cdf1509fb38480298a","abstract_canon_sha256":"053a40d90ded56f74e15afc036b51b1762a7679346f92b1a850600fbc292c44a"},"schema_version":"1.0"},"canonical_sha256":"c6cd69ae990c0b2396f6fe3c62813d7d07869f4ee4934beda2a71f75f8cd1658","source":{"kind":"arxiv","id":"1306.2096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2096","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2096v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2096","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y3GWTLUZBQFS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y3GWTLUZBQFSHFXW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y3GWTLUZ","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Y3GWTLUZBQFSHFXW7Y6GFAJ5PU","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-06-10T03:35:07Z","cross_cats_sorted":[],"title_canon_sha256":"03df80c02b9e85accc42aecc698a06d3406bf6b48dc2b5cdf1509fb38480298a","abstract_canon_sha256":"053a40d90ded56f74e15afc036b51b1762a7679346f92b1a850600fbc292c44a"},"schema_version":"1.0"},"canonical_sha256":"c6cd69ae990c0b2396f6fe3c62813d7d07869f4ee4934beda2a71f75f8cd1658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.399989Z","signature_b64":"VSGwmwW9F+jtq7q5oCEFf5TquvMiH5Di5dTFfa7HP1y0JyOI3nUvI+IEYVcD/qGJu10+MLyoxH94z2nhTvYiBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6cd69ae990c0b2396f6fe3c62813d7d07869f4ee4934beda2a71f75f8cd1658","last_reissued_at":"2026-05-18T03:21:22.399324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.399324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2096","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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I78FBrp67KxyyK30QthWO214GbDTjHNqb40g0lQlIX61IJmgzL19OrLOqtf6hkd8PhY68ieFhzW3ntI/0Zs6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:02:34.075047Z"},"content_sha256":"8d05263744b7efabab671cfca72edaffb225de9fb403ac6e76ffb5ae2dae6ac8","schema_version":"1.0","event_id":"sha256:8d05263744b7efabab671cfca72edaffb225de9fb403ac6e76ffb5ae2dae6ac8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Y3GWTLUZBQFSHFXW7Y6GFAJ5PU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature-Gathering Dependency-Based Software Clustering Using Dedication and Modularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Akihiko Matsuo, Keisuke Yano, Kenichi Kobayashi (Fujitsu Laboratories), Koki Kato, Manabu Kamimura","submitted_at":"2013-06-10T03:35:07Z","abstract_excerpt":"Software clustering is one of the important techniques to comprehend software systems. However, presented techniques to date require human interactions to refine clustering results. In this paper, we proposed a novel dependency-based software clustering algorithm, SArF. SArF has two characteristics. First, SArF eliminates the need of the omnipresent-module-removing step which requires human interactions. Second, the objective of SArF is to gather relevant software features or functionalities into a cluster. To achieve them, we defined the Dedication score to infer the importance of dependencie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2096","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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKaOtiW37HNneChJ1ROxkPaCrmIfK8vjgNB40GS3QItsBzc5jprO4EjJZYE+E763kpbEbXH26t7W/ZBf38v7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:02:34.075414Z"},"content_sha256":"7fd4d06d17d100e1ecc99fe8f6d9de473f70cc3bbdd06e8cc80d15d3bd44954b","schema_version":"1.0","event_id":"sha256:7fd4d06d17d100e1ecc99fe8f6d9de473f70cc3bbdd06e8cc80d15d3bd44954b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/bundle.json","state_url":"https://pith.science/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/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-07-04T07:02:34Z","links":{"resolver":"https://pith.science/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU","bundle":"https://pith.science/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/bundle.json","state":"https://pith.science/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3GWTLUZBQFSHFXW7Y6GFAJ5PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Y3GWTLUZBQFSHFXW7Y6GFAJ5PU","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":"053a40d90ded56f74e15afc036b51b1762a7679346f92b1a850600fbc292c44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-06-10T03:35:07Z","title_canon_sha256":"03df80c02b9e85accc42aecc698a06d3406bf6b48dc2b5cdf1509fb38480298a"},"schema_version":"1.0","source":{"id":"1306.2096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2096","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2096v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2096","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"Y3GWTLUZBQFS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y3GWTLUZBQFSHFXW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y3GWTLUZ","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:7fd4d06d17d100e1ecc99fe8f6d9de473f70cc3bbdd06e8cc80d15d3bd44954b","target":"graph","created_at":"2026-05-18T03:21:22Z","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":"Software clustering is one of the important techniques to comprehend software systems. However, presented techniques to date require human interactions to refine clustering results. In this paper, we proposed a novel dependency-based software clustering algorithm, SArF. SArF has two characteristics. First, SArF eliminates the need of the omnipresent-module-removing step which requires human interactions. Second, the objective of SArF is to gather relevant software features or functionalities into a cluster. To achieve them, we defined the Dedication score to infer the importance of dependencie","authors_text":"Akihiko Matsuo, Keisuke Yano, Kenichi Kobayashi (Fujitsu Laboratories), Koki Kato, Manabu Kamimura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-06-10T03:35:07Z","title":"Feature-Gathering Dependency-Based Software Clustering Using Dedication and Modularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2096","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:8d05263744b7efabab671cfca72edaffb225de9fb403ac6e76ffb5ae2dae6ac8","target":"record","created_at":"2026-05-18T03:21:22Z","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":"053a40d90ded56f74e15afc036b51b1762a7679346f92b1a850600fbc292c44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-06-10T03:35:07Z","title_canon_sha256":"03df80c02b9e85accc42aecc698a06d3406bf6b48dc2b5cdf1509fb38480298a"},"schema_version":"1.0","source":{"id":"1306.2096","kind":"arxiv","version":1}},"canonical_sha256":"c6cd69ae990c0b2396f6fe3c62813d7d07869f4ee4934beda2a71f75f8cd1658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6cd69ae990c0b2396f6fe3c62813d7d07869f4ee4934beda2a71f75f8cd1658","first_computed_at":"2026-05-18T03:21:22.399324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.399324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VSGwmwW9F+jtq7q5oCEFf5TquvMiH5Di5dTFfa7HP1y0JyOI3nUvI+IEYVcD/qGJu10+MLyoxH94z2nhTvYiBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.399989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d05263744b7efabab671cfca72edaffb225de9fb403ac6e76ffb5ae2dae6ac8","sha256:7fd4d06d17d100e1ecc99fe8f6d9de473f70cc3bbdd06e8cc80d15d3bd44954b"],"state_sha256":"fe6bd1ba48384fed4a27b54ee8dd7f5179a7c1446a3ea5a4f98d6db0500ea6da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KMT9zcVQ22vSeHW4w5bcccki5xzsnO/7uo4VZUwztIk1mjPD8g5zyM/jSWDMVkZAT2XP7ukW+kePPBZ6S1ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:02:34.077321Z","bundle_sha256":"ff0c9848d0d649e7015588f5189e48ab53b0167f6d02551e74de8346b19fe832"}}