{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BVUMBABHKBMG5RRJKQMLNCB2QY","short_pith_number":"pith:BVUMBABH","canonical_record":{"source":{"id":"1606.04056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-13T18:18:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"570b0fe5e43d08092dd604aa963e5f941fe45f3c44b998f86d13e05404f61702","abstract_canon_sha256":"7541da99f6ad09fba2f54df4940fa1b3f21682902d2dd30f4de9a4e7607f8110"},"schema_version":"1.0"},"canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","source":{"kind":"arxiv","id":"1606.04056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04056","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04056v1","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04056","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"BVUMBABHKBMG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVUMBABHKBMG5RRJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVUMBABH","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BVUMBABHKBMG5RRJKQMLNCB2QY","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-13T18:18:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"570b0fe5e43d08092dd604aa963e5f941fe45f3c44b998f86d13e05404f61702","abstract_canon_sha256":"7541da99f6ad09fba2f54df4940fa1b3f21682902d2dd30f4de9a4e7607f8110"},"schema_version":"1.0"},"canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:32.267751Z","signature_b64":"sndDU7s8Xt7NClFpxPnvmf0Qz1kVTNL7iFIQ4TB8BUT5jDWZ5XWi+MZAH1tDCaa1msMSS/PbnFGllVpzEW0rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","last_reissued_at":"2026-05-18T01:12:32.267176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:32.267176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04056","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:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7QBSpkwWfdEA3I/R4gR2yx55ZBy3oE2y+JxMM0xw4GOFqf4KXYaXX2KWHJ7/tL4Y06nJRXCV1AJz9h730d6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:59:31.524853Z"},"content_sha256":"dd2a2d60265d4da41a5bd0020bd276b8cbeb227d76b5c942e4c3665d7c8e6e9f","schema_version":"1.0","event_id":"sha256:dd2a2d60265d4da41a5bd0020bd276b8cbeb227d76b5c942e4c3665d7c8e6e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BVUMBABHKBMG5RRJKQMLNCB2QY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the exact learnability of graph parameters: The case of partition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LG","authors_text":"Johann A. Makowsky, Nadia Labai","submitted_at":"2016-06-13T18:18:08Z","abstract_excerpt":"We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\\alpha$ and edge weights $\\beta$. M. Freedman, L. Lov\\'asz and A. Schrijver have given a characterization of these graph parameters in terms of the $k$-connection matrices $C(f,k)$ of $f$. Our model of learnability is based on D. Angluin's model of exact learning using membership and equivalence queries. Given such a graph parameter $f$, the learner can ask for the values of $f$ for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04056","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:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpNokLM2zYyWbaMcFXNejOCcJpfoQjyDV3WPhYfvSuua4hrhO6XbbsVDES+iWGjlqogDW3wVKjuRdxCWZsscCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:59:31.525195Z"},"content_sha256":"2a53e9fc19fcfe9023a77307e0b0fcc7c255e280cfc535e5b272254dccf6374e","schema_version":"1.0","event_id":"sha256:2a53e9fc19fcfe9023a77307e0b0fcc7c255e280cfc535e5b272254dccf6374e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/bundle.json","state_url":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/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-12T05:59:31Z","links":{"resolver":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY","bundle":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/bundle.json","state":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BVUMBABHKBMG5RRJKQMLNCB2QY","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":"7541da99f6ad09fba2f54df4940fa1b3f21682902d2dd30f4de9a4e7607f8110","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-13T18:18:08Z","title_canon_sha256":"570b0fe5e43d08092dd604aa963e5f941fe45f3c44b998f86d13e05404f61702"},"schema_version":"1.0","source":{"id":"1606.04056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04056","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04056v1","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04056","created_at":"2026-05-18T01:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"BVUMBABHKBMG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BVUMBABHKBMG5RRJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BVUMBABH","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:2a53e9fc19fcfe9023a77307e0b0fcc7c255e280cfc535e5b272254dccf6374e","target":"graph","created_at":"2026-05-18T01:12:32Z","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":"We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\\alpha$ and edge weights $\\beta$. M. Freedman, L. Lov\\'asz and A. Schrijver have given a characterization of these graph parameters in terms of the $k$-connection matrices $C(f,k)$ of $f$. Our model of learnability is based on D. Angluin's model of exact learning using membership and equivalence queries. Given such a graph parameter $f$, the learner can ask for the values of $f$ for ","authors_text":"Johann A. Makowsky, Nadia Labai","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-13T18:18:08Z","title":"On the exact learnability of graph parameters: The case of partition functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04056","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:dd2a2d60265d4da41a5bd0020bd276b8cbeb227d76b5c942e4c3665d7c8e6e9f","target":"record","created_at":"2026-05-18T01:12:32Z","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":"7541da99f6ad09fba2f54df4940fa1b3f21682902d2dd30f4de9a4e7607f8110","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-13T18:18:08Z","title_canon_sha256":"570b0fe5e43d08092dd604aa963e5f941fe45f3c44b998f86d13e05404f61702"},"schema_version":"1.0","source":{"id":"1606.04056","kind":"arxiv","version":1}},"canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","first_computed_at":"2026-05-18T01:12:32.267176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:32.267176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sndDU7s8Xt7NClFpxPnvmf0Qz1kVTNL7iFIQ4TB8BUT5jDWZ5XWi+MZAH1tDCaa1msMSS/PbnFGllVpzEW0rCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:32.267751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd2a2d60265d4da41a5bd0020bd276b8cbeb227d76b5c942e4c3665d7c8e6e9f","sha256:2a53e9fc19fcfe9023a77307e0b0fcc7c255e280cfc535e5b272254dccf6374e"],"state_sha256":"ff38b9b9351c74c3dc1ff1b68151be9c6dd33444c58e273620fb7e9cf1d95e2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8r2mq8/FD3xMZSYKMOrB+ppIhyVxlAb8j5oT1Z21SEKMk04OEF/gvd9Ev+u5KzUQ+2ZUwHwoeqh9VRDDTSXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:59:31.527144Z","bundle_sha256":"2629565c0aa03fa947d766db94c78a2d6bb748ab1c3211c69b99ba0ead06009c"}}