{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KRMA6TFA4REBTRY3KZN54KDD73","short_pith_number":"pith:KRMA6TFA","canonical_record":{"source":{"id":"1609.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1d780bf63c6b851ce5720cee301ac7c704701936681a9ae6627d04c33f211094","abstract_canon_sha256":"b72ba8c641f17eb3c7b454f1c45a21a0252f47edd58171e35f9a36dd17ac28c0"},"schema_version":"1.0"},"canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","source":{"kind":"arxiv","id":"1609.08266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08266","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08266v1","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08266","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"KRMA6TFA4REB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRMA6TFA4REBTRY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRMA6TFA","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KRMA6TFA4REBTRY3KZN54KDD73","target":"record","payload":{"canonical_record":{"source":{"id":"1609.08266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1d780bf63c6b851ce5720cee301ac7c704701936681a9ae6627d04c33f211094","abstract_canon_sha256":"b72ba8c641f17eb3c7b454f1c45a21a0252f47edd58171e35f9a36dd17ac28c0"},"schema_version":"1.0"},"canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:46.276383Z","signature_b64":"5IIMqCIjO3tN1zj9QS5ZoaIFDSza0ZfQbnOS3nFjzUO0QP1CIeE+DTVzmj4b+GAVLCV19vK7g/8gkqED/iTiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","last_reissued_at":"2026-05-18T01:03:46.275961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:46.275961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.08266","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-18T01:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPn5srFlSwr+wZxf+uUhbJE/cnb7k0oE1hJLBbK6qqOrIrTRA7KKcrT+pTmKoCVijIFu0mI4pxmB0a+4TkcMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:48:16.662638Z"},"content_sha256":"76378fde182b58e32df0afe64b593611422d7af72e7cc3bcfaaf104235d89a24","schema_version":"1.0","event_id":"sha256:76378fde182b58e32df0afe64b593611422d7af72e7cc3bcfaaf104235d89a24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KRMA6TFA4REBTRY3KZN54KDD73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Statistically Significant Attribute Associations in Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jihwan Lee, Keehwan Park, Sunil Prabhakar","submitted_at":"2016-09-27T05:53:45Z","abstract_excerpt":"Recently, graphs have been widely used to represent many different kinds of real world data or observations such as social networks, protein-protein networks, road networks, and so on. In many cases, each node in a graph is associated with a set of its attributes and it is critical to not only consider the link structure of a graph but also use the attribute information to achieve more meaningful results in various graph mining tasks. Most previous works with attributed graphs take into ac- count attribute relationships only between individually connected nodes. However, it should be greatly v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08266","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-18T01:03:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE1DeFtxRqfwduXfIkOAph3A08QsLsf95L2DsGXYjzTvrXdnkTQj5KSmD3H7uIDhBTKAxUpxxRZ6qw9vwSXWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:48:16.663014Z"},"content_sha256":"4ae1ef7b015aa2d5e0858965de05e4299bf798ffb29fcbc6b1a081767ee4f42f","schema_version":"1.0","event_id":"sha256:4ae1ef7b015aa2d5e0858965de05e4299bf798ffb29fcbc6b1a081767ee4f42f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/bundle.json","state_url":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRMA6TFA4REBTRY3KZN54KDD73/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-30T02:48:16Z","links":{"resolver":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73","bundle":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/bundle.json","state":"https://pith.science/pith/KRMA6TFA4REBTRY3KZN54KDD73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRMA6TFA4REBTRY3KZN54KDD73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KRMA6TFA4REBTRY3KZN54KDD73","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":"b72ba8c641f17eb3c7b454f1c45a21a0252f47edd58171e35f9a36dd17ac28c0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","title_canon_sha256":"1d780bf63c6b851ce5720cee301ac7c704701936681a9ae6627d04c33f211094"},"schema_version":"1.0","source":{"id":"1609.08266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08266","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08266v1","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08266","created_at":"2026-05-18T01:03:46Z"},{"alias_kind":"pith_short_12","alias_value":"KRMA6TFA4REB","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KRMA6TFA4REBTRY3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KRMA6TFA","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:4ae1ef7b015aa2d5e0858965de05e4299bf798ffb29fcbc6b1a081767ee4f42f","target":"graph","created_at":"2026-05-18T01:03:46Z","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":"Recently, graphs have been widely used to represent many different kinds of real world data or observations such as social networks, protein-protein networks, road networks, and so on. In many cases, each node in a graph is associated with a set of its attributes and it is critical to not only consider the link structure of a graph but also use the attribute information to achieve more meaningful results in various graph mining tasks. Most previous works with attributed graphs take into ac- count attribute relationships only between individually connected nodes. However, it should be greatly v","authors_text":"Jihwan Lee, Keehwan Park, Sunil Prabhakar","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","title":"Mining Statistically Significant Attribute Associations in Attributed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08266","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:76378fde182b58e32df0afe64b593611422d7af72e7cc3bcfaaf104235d89a24","target":"record","created_at":"2026-05-18T01:03:46Z","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":"b72ba8c641f17eb3c7b454f1c45a21a0252f47edd58171e35f9a36dd17ac28c0","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-09-27T05:53:45Z","title_canon_sha256":"1d780bf63c6b851ce5720cee301ac7c704701936681a9ae6627d04c33f211094"},"schema_version":"1.0","source":{"id":"1609.08266","kind":"arxiv","version":1}},"canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54580f4ca0e44819c71b565bde2863fec08950f368303c351011f208277f0367","first_computed_at":"2026-05-18T01:03:46.275961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:46.275961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5IIMqCIjO3tN1zj9QS5ZoaIFDSza0ZfQbnOS3nFjzUO0QP1CIeE+DTVzmj4b+GAVLCV19vK7g/8gkqED/iTiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:46.276383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76378fde182b58e32df0afe64b593611422d7af72e7cc3bcfaaf104235d89a24","sha256:4ae1ef7b015aa2d5e0858965de05e4299bf798ffb29fcbc6b1a081767ee4f42f"],"state_sha256":"9c25731b068ee22666ded15ea887d28b33d2a765af60797a1b36c6adb29d211e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWJdTiG8uLf8Y1wOMsnznLCIjesSUYROlC3AZTK8UH09Qw0KkJDvHPM05xb2nZW+Au2wPe2Z20R6Hw8CEYClBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T02:48:16.665553Z","bundle_sha256":"a1be7a5cbafcf7221921ef42f254647d3a6b568c9dcfc6e99beacbf8f3500180"}}