{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZL6QBTQLH3KPMUDI2Q3WPH4QZW","short_pith_number":"pith:ZL6QBTQL","canonical_record":{"source":{"id":"1705.09026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-25T02:28:53Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0c680ebb557d11e90063247e36bbd8a706e939617de5df9ebbb40c3bd12e62a6","abstract_canon_sha256":"87d37a2d68881cb8266fbe85146dcf20bd3496dcd4a1965a1b92a03516f82381"},"schema_version":"1.0"},"canonical_sha256":"cafd00ce0b3ed4f65068d437679f90cda4582a2af095ad2b59d29583b0397c45","source":{"kind":"arxiv","id":"1705.09026","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09026","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09026v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09026","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZL6QBTQLH3KP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZL6QBTQLH3KPMUDI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZL6QBTQL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZL6QBTQLH3KPMUDI2Q3WPH4QZW","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09026","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-25T02:28:53Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0c680ebb557d11e90063247e36bbd8a706e939617de5df9ebbb40c3bd12e62a6","abstract_canon_sha256":"87d37a2d68881cb8266fbe85146dcf20bd3496dcd4a1965a1b92a03516f82381"},"schema_version":"1.0"},"canonical_sha256":"cafd00ce0b3ed4f65068d437679f90cda4582a2af095ad2b59d29583b0397c45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:37.659924Z","signature_b64":"1zKafkQePVOsSi8ws1qheFr8ShbN+Df784w0HWk4o+Q33ilXzcYcOz2IF0mbaRG6RDiJnR6roMvl6cageZT3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cafd00ce0b3ed4f65068d437679f90cda4582a2af095ad2b59d29583b0397c45","last_reissued_at":"2026-05-18T00:15:37.659429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:37.659429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09026","source_version":2,"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MSTm0surxA19ftDMyjoDquCRBnQTYsY+cwJ+25GfuaRauwGYih1598uPQPtQnmyd34IWXMgjZsTdl64NIlmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:28.889192Z"},"content_sha256":"b8fe2f202a9f98327beb7637b00c5d607568562d8fb0f1903e87611606ecf890","schema_version":"1.0","event_id":"sha256:b8fe2f202a9f98327beb7637b00c5d607568562d8fb0f1903e87611606ecf890"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZL6QBTQLH3KPMUDI2Q3WPH4QZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best-Choice Edge Grafting for Efficient Structure Learning of Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bert Huang, Walid Chaabene","submitted_at":"2017-05-25T02:28:53Z","abstract_excerpt":"Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an incrementally grown active set of features. In this paper, we address key computational bottlenecks that current incremental techniques still suffer by introducing best-choice edge grafting, an incremental, structured method that activates edges as groups of features in a streaming setting. The method uses a reservoir of edges that satisfy an activation con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09026","kind":"arxiv","version":2},"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:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3+a8ohdU+Hah3OC7Z7nlBodP2K8lvahQNVZECSaADmlczB/XTcxBDO1XASVKS4R2lpureKTPY1TWXyCo7miAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:28.889957Z"},"content_sha256":"5137b48b3fe0bf2b7f882766ced41dc204ee7c2bdc3794043492e2eb383e3b9c","schema_version":"1.0","event_id":"sha256:5137b48b3fe0bf2b7f882766ced41dc204ee7c2bdc3794043492e2eb383e3b9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/bundle.json","state_url":"https://pith.science/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/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-31T21:14:28Z","links":{"resolver":"https://pith.science/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW","bundle":"https://pith.science/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/bundle.json","state":"https://pith.science/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZL6QBTQLH3KPMUDI2Q3WPH4QZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZL6QBTQLH3KPMUDI2Q3WPH4QZW","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":"87d37a2d68881cb8266fbe85146dcf20bd3496dcd4a1965a1b92a03516f82381","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-25T02:28:53Z","title_canon_sha256":"0c680ebb557d11e90063247e36bbd8a706e939617de5df9ebbb40c3bd12e62a6"},"schema_version":"1.0","source":{"id":"1705.09026","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09026","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09026v2","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09026","created_at":"2026-05-18T00:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"ZL6QBTQLH3KP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZL6QBTQLH3KPMUDI","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZL6QBTQL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:5137b48b3fe0bf2b7f882766ced41dc204ee7c2bdc3794043492e2eb383e3b9c","target":"graph","created_at":"2026-05-18T00:15:37Z","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":"Incremental methods for structure learning of pairwise Markov random fields (MRFs), such as grafting, improve scalability by avoiding inference over the entire feature space in each optimization step. Instead, inference is performed over an incrementally grown active set of features. In this paper, we address key computational bottlenecks that current incremental techniques still suffer by introducing best-choice edge grafting, an incremental, structured method that activates edges as groups of features in a streaming setting. The method uses a reservoir of edges that satisfy an activation con","authors_text":"Bert Huang, Walid Chaabene","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-25T02:28:53Z","title":"Best-Choice Edge Grafting for Efficient Structure Learning of Markov Random Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09026","kind":"arxiv","version":2},"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:b8fe2f202a9f98327beb7637b00c5d607568562d8fb0f1903e87611606ecf890","target":"record","created_at":"2026-05-18T00:15:37Z","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":"87d37a2d68881cb8266fbe85146dcf20bd3496dcd4a1965a1b92a03516f82381","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-25T02:28:53Z","title_canon_sha256":"0c680ebb557d11e90063247e36bbd8a706e939617de5df9ebbb40c3bd12e62a6"},"schema_version":"1.0","source":{"id":"1705.09026","kind":"arxiv","version":2}},"canonical_sha256":"cafd00ce0b3ed4f65068d437679f90cda4582a2af095ad2b59d29583b0397c45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cafd00ce0b3ed4f65068d437679f90cda4582a2af095ad2b59d29583b0397c45","first_computed_at":"2026-05-18T00:15:37.659429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:37.659429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1zKafkQePVOsSi8ws1qheFr8ShbN+Df784w0HWk4o+Q33ilXzcYcOz2IF0mbaRG6RDiJnR6roMvl6cageZT3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:37.659924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09026","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8fe2f202a9f98327beb7637b00c5d607568562d8fb0f1903e87611606ecf890","sha256:5137b48b3fe0bf2b7f882766ced41dc204ee7c2bdc3794043492e2eb383e3b9c"],"state_sha256":"f95f8b55657fb3b8472c3c19b909c4499e6dba6fb0829d73d59cbbe09eedc9a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJjJQrW3KWrIY9wJwlQ4JEdlIPzdwzkoMnlZnPTq/tqIzM1qZ9g65HcQDXgMPqeD2JfkvddfUlZ/SmCjlpXABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:14:28.894491Z","bundle_sha256":"9555afcb097c631bbcff045938280d9e013d84e926731cacfa196d6c0dc71643"}}