{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:77WTCJR4HAYYKS7NTIBON5QP4J","short_pith_number":"pith:77WTCJR4","canonical_record":{"source":{"id":"1705.02961","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-08T16:37:00Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"f6cf00e6a927da2bd29bbb1aa983cbd2348aef49c1ff569f679df7079db950b1","abstract_canon_sha256":"5e99257ab236c1f8d8f9ae1d097cb60c873c74cc6ad381161529622d4ab59d53"},"schema_version":"1.0"},"canonical_sha256":"ffed31263c3831854bed9a02e6f60fe25050c93a22e3280f96485eee032ff735","source":{"kind":"arxiv","id":"1705.02961","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02961","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02961v3","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02961","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"77WTCJR4HAYY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77WTCJR4HAYYKS7N","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77WTCJR4","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:77WTCJR4HAYYKS7NTIBON5QP4J","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02961","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-08T16:37:00Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"f6cf00e6a927da2bd29bbb1aa983cbd2348aef49c1ff569f679df7079db950b1","abstract_canon_sha256":"5e99257ab236c1f8d8f9ae1d097cb60c873c74cc6ad381161529622d4ab59d53"},"schema_version":"1.0"},"canonical_sha256":"ffed31263c3831854bed9a02e6f60fe25050c93a22e3280f96485eee032ff735","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:33.015596Z","signature_b64":"nIrNPc0S+t/xAYz1L6QcUy5Bhhjni3bJxJ9uH90kLQJZwAIkrNANN58sa4QdzG8jeDw8bsnjmA1XziOTypw6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffed31263c3831854bed9a02e6f60fe25050c93a22e3280f96485eee032ff735","last_reissued_at":"2026-05-18T00:41:33.014998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:33.014998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02961","source_version":3,"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-18T00:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ja4BcAi2stcOAmymBUEgxuUCNinRz9s14MhkDrHKLuimdaSe1vbhyKl4Ovyqk3KFOihcXtYEqPT/93z6FLByCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:24:53.569700Z"},"content_sha256":"1332fe98fec842a787ba4a91a2e904c31090435a1b235388a93c58de1aa697d3","schema_version":"1.0","event_id":"sha256:1332fe98fec842a787ba4a91a2e904c31090435a1b235388a93c58de1aa697d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:77WTCJR4HAYYKS7NTIBON5QP4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A branch-and-price approach with MILP formulation to modularity density maximization on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.SI","authors_text":"Keisuke Sato, Yoichi Izunaga","submitted_at":"2017-05-08T16:37:00Z","abstract_excerpt":"For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity. The problem can be interpreted as the set-partitioning problem, which reminds us of its integer linear programming (ILP) formulation. We provide a branch-and-price framework for solving this ILP, or column generation combined with branch-and-bound. Above all, we formulate the column generation subproblem to be solved repeatedly as a simpler mixed integer linear programming (MILP) problem. Accel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02961","kind":"arxiv","version":3},"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-18T00:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbqKn/Yi3fuKXxEay+3Ma7psmdEvCo5soYmMFrwWmvncQVGM2b0S17FMzntL8yBRE/M4csht6qAySd+33g2WCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:24:53.570055Z"},"content_sha256":"f760f082116f02d0f11542d13f2a2d2d0a024700142b449561325c09d20b5b8d","schema_version":"1.0","event_id":"sha256:f760f082116f02d0f11542d13f2a2d2d0a024700142b449561325c09d20b5b8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77WTCJR4HAYYKS7NTIBON5QP4J/bundle.json","state_url":"https://pith.science/pith/77WTCJR4HAYYKS7NTIBON5QP4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77WTCJR4HAYYKS7NTIBON5QP4J/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-22T23:24:53Z","links":{"resolver":"https://pith.science/pith/77WTCJR4HAYYKS7NTIBON5QP4J","bundle":"https://pith.science/pith/77WTCJR4HAYYKS7NTIBON5QP4J/bundle.json","state":"https://pith.science/pith/77WTCJR4HAYYKS7NTIBON5QP4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77WTCJR4HAYYKS7NTIBON5QP4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:77WTCJR4HAYYKS7NTIBON5QP4J","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":"5e99257ab236c1f8d8f9ae1d097cb60c873c74cc6ad381161529622d4ab59d53","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-08T16:37:00Z","title_canon_sha256":"f6cf00e6a927da2bd29bbb1aa983cbd2348aef49c1ff569f679df7079db950b1"},"schema_version":"1.0","source":{"id":"1705.02961","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02961","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02961v3","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02961","created_at":"2026-05-18T00:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"77WTCJR4HAYY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"77WTCJR4HAYYKS7N","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"77WTCJR4","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f760f082116f02d0f11542d13f2a2d2d0a024700142b449561325c09d20b5b8d","target":"graph","created_at":"2026-05-18T00:41:33Z","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":"For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity. The problem can be interpreted as the set-partitioning problem, which reminds us of its integer linear programming (ILP) formulation. We provide a branch-and-price framework for solving this ILP, or column generation combined with branch-and-bound. Above all, we formulate the column generation subproblem to be solved repeatedly as a simpler mixed integer linear programming (MILP) problem. Accel","authors_text":"Keisuke Sato, Yoichi Izunaga","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-08T16:37:00Z","title":"A branch-and-price approach with MILP formulation to modularity density maximization on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02961","kind":"arxiv","version":3},"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:1332fe98fec842a787ba4a91a2e904c31090435a1b235388a93c58de1aa697d3","target":"record","created_at":"2026-05-18T00:41:33Z","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":"5e99257ab236c1f8d8f9ae1d097cb60c873c74cc6ad381161529622d4ab59d53","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-05-08T16:37:00Z","title_canon_sha256":"f6cf00e6a927da2bd29bbb1aa983cbd2348aef49c1ff569f679df7079db950b1"},"schema_version":"1.0","source":{"id":"1705.02961","kind":"arxiv","version":3}},"canonical_sha256":"ffed31263c3831854bed9a02e6f60fe25050c93a22e3280f96485eee032ff735","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffed31263c3831854bed9a02e6f60fe25050c93a22e3280f96485eee032ff735","first_computed_at":"2026-05-18T00:41:33.014998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:33.014998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nIrNPc0S+t/xAYz1L6QcUy5Bhhjni3bJxJ9uH90kLQJZwAIkrNANN58sa4QdzG8jeDw8bsnjmA1XziOTypw6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:33.015596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02961","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1332fe98fec842a787ba4a91a2e904c31090435a1b235388a93c58de1aa697d3","sha256:f760f082116f02d0f11542d13f2a2d2d0a024700142b449561325c09d20b5b8d"],"state_sha256":"eeaae8c92e0bedf34a701547af3758e5cc1aab1c2cc4ed1878fe787710aca6ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgLTBDwOYG6fncem9IkOlfiSQ9qZqveewV3rc2CFE2btsY4t106bft5UMalLHeJU0FiHgeZKo19vMwOLkheyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:24:53.572098Z","bundle_sha256":"07ad8d53b05a96cb2a493e8537bd9276bc12be5693e81a85c181f6ca71e2f44f"}}