{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RDRUU27QSYASWQQV7V32YBN43R","short_pith_number":"pith:RDRUU27Q","canonical_record":{"source":{"id":"1301.6626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-28T18:00:33Z","cross_cats_sorted":["cs.DB","stat.ML"],"title_canon_sha256":"f6eef7e72fae3c83b2fabf0952f884095e9933c099d9acb1f560348d63284317","abstract_canon_sha256":"319544ae81c8198d82ef4e0c7713a57140ef1425c89df9f9eac758a9d6b54001"},"schema_version":"1.0"},"canonical_sha256":"88e34a6bf096012b4215fd77ac05bcdc49a9cc84fe9cfa643d93436c246fa0ec","source":{"kind":"arxiv","id":"1301.6626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6626","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6626v1","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6626","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"RDRUU27QSYAS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDRUU27QSYASWQQV","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDRUU27Q","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RDRUU27QSYASWQQV7V32YBN43R","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-28T18:00:33Z","cross_cats_sorted":["cs.DB","stat.ML"],"title_canon_sha256":"f6eef7e72fae3c83b2fabf0952f884095e9933c099d9acb1f560348d63284317","abstract_canon_sha256":"319544ae81c8198d82ef4e0c7713a57140ef1425c89df9f9eac758a9d6b54001"},"schema_version":"1.0"},"canonical_sha256":"88e34a6bf096012b4215fd77ac05bcdc49a9cc84fe9cfa643d93436c246fa0ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:14.815918Z","signature_b64":"CAhbzYxc05MAN2NrPsqrEUopXq+BnCO0KyQMO67lEmXKkIcQUmFezVtKOvMnli86gM71Lxab4gVZQox4PAx3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e34a6bf096012b4215fd77ac05bcdc49a9cc84fe9cfa643d93436c246fa0ec","last_reissued_at":"2026-05-18T03:35:14.815169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:14.815169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6626","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NT5BuH08gPQnZNR/XStUJOt68XA9CJQl32G7GiRaQ+IgGwAdA+pjBb4GfKDAxlgU4EX30KkBbspXWIfqGigADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:57:22.743277Z"},"content_sha256":"277d75d2d498f195f6a58fa5d52b64453bf3851cde33610e73f26fa8f52442b6","schema_version":"1.0","event_id":"sha256:277d75d2d498f195f6a58fa5d52b64453bf3851cde33610e73f26fa8f52442b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RDRUU27QSYASWQQV7V32YBN43R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Feature Selection for Uncertain Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ann B. Ragin, Philip S. Yu, Xiangnan Kong, Xue Wang","submitted_at":"2013-01-28T18:00:33Z","abstract_excerpt":"Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objects are certain, and the binary edges within each graph represent the \"presence\" of linkages among the nodes. In many real-world applications, however, the linkage structure of the graphs is inherently uncertain. Therefore, existing measurements of interestingness based upon certa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6626","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeVrKZOXpcb2zOl82dPr1q91WaJ3xJPJL10VyOHbae05JdEI5SaMyly2v93S6os7v5vgYbJwySG65p03J4AEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:57:22.743893Z"},"content_sha256":"d8003a864c13f3b2bac21f8f8c8c669722fff15503820efcca9ae0bb6bd331a3","schema_version":"1.0","event_id":"sha256:d8003a864c13f3b2bac21f8f8c8c669722fff15503820efcca9ae0bb6bd331a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDRUU27QSYASWQQV7V32YBN43R/bundle.json","state_url":"https://pith.science/pith/RDRUU27QSYASWQQV7V32YBN43R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDRUU27QSYASWQQV7V32YBN43R/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-05-27T10:57:22Z","links":{"resolver":"https://pith.science/pith/RDRUU27QSYASWQQV7V32YBN43R","bundle":"https://pith.science/pith/RDRUU27QSYASWQQV7V32YBN43R/bundle.json","state":"https://pith.science/pith/RDRUU27QSYASWQQV7V32YBN43R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDRUU27QSYASWQQV7V32YBN43R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RDRUU27QSYASWQQV7V32YBN43R","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":"319544ae81c8198d82ef4e0c7713a57140ef1425c89df9f9eac758a9d6b54001","cross_cats_sorted":["cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-28T18:00:33Z","title_canon_sha256":"f6eef7e72fae3c83b2fabf0952f884095e9933c099d9acb1f560348d63284317"},"schema_version":"1.0","source":{"id":"1301.6626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6626","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6626v1","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6626","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"RDRUU27QSYAS","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RDRUU27QSYASWQQV","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RDRUU27Q","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d8003a864c13f3b2bac21f8f8c8c669722fff15503820efcca9ae0bb6bd331a3","target":"graph","created_at":"2026-05-18T03:35:14Z","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":"Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objects are certain, and the binary edges within each graph represent the \"presence\" of linkages among the nodes. In many real-world applications, however, the linkage structure of the graphs is inherently uncertain. Therefore, existing measurements of interestingness based upon certa","authors_text":"Ann B. Ragin, Philip S. Yu, Xiangnan Kong, Xue Wang","cross_cats":["cs.DB","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-28T18:00:33Z","title":"Discriminative Feature Selection for Uncertain Graph Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6626","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:277d75d2d498f195f6a58fa5d52b64453bf3851cde33610e73f26fa8f52442b6","target":"record","created_at":"2026-05-18T03:35:14Z","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":"319544ae81c8198d82ef4e0c7713a57140ef1425c89df9f9eac758a9d6b54001","cross_cats_sorted":["cs.DB","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-28T18:00:33Z","title_canon_sha256":"f6eef7e72fae3c83b2fabf0952f884095e9933c099d9acb1f560348d63284317"},"schema_version":"1.0","source":{"id":"1301.6626","kind":"arxiv","version":1}},"canonical_sha256":"88e34a6bf096012b4215fd77ac05bcdc49a9cc84fe9cfa643d93436c246fa0ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e34a6bf096012b4215fd77ac05bcdc49a9cc84fe9cfa643d93436c246fa0ec","first_computed_at":"2026-05-18T03:35:14.815169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:14.815169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAhbzYxc05MAN2NrPsqrEUopXq+BnCO0KyQMO67lEmXKkIcQUmFezVtKOvMnli86gM71Lxab4gVZQox4PAx3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:14.815918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:277d75d2d498f195f6a58fa5d52b64453bf3851cde33610e73f26fa8f52442b6","sha256:d8003a864c13f3b2bac21f8f8c8c669722fff15503820efcca9ae0bb6bd331a3"],"state_sha256":"9eff1853c073eb5e732a67967bbd2f0bc09e8e8895c81c1e2b7498ee3ab75722"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMVqqoomTrccjYZOTU1QXywqQtd79ioMtZEZnPhinMOjdkDmdglbSMQG8kO34YlP2DIvFZZUBhlS3FFHwfmrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:57:22.747287Z","bundle_sha256":"5491f06ac47bcdc24f95dfc55dcff3a1e9ebc3fa186f7a6e80c39064fa03f3f5"}}