{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BVUMBABHKBMG5RRJKQMLNCB2QY","short_pith_number":"pith:BVUMBABH","schema_version":"1.0","canonical_sha256":"0d68c0802750586ec6295418b6883a86024aa336ae8f425d268a86ff38916470","source":{"kind":"arxiv","id":"1606.04056","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.04056","created_at":"2026-05-18T01:12:32.267273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04056v1","created_at":"2026-05-18T01:12:32.267273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04056","created_at":"2026-05-18T01:12:32.267273+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVUMBABHKBMG","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVUMBABHKBMG5RRJ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVUMBABH","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY","json":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY.json","graph_json":"https://pith.science/api/pith-number/BVUMBABHKBMG5RRJKQMLNCB2QY/graph.json","events_json":"https://pith.science/api/pith-number/BVUMBABHKBMG5RRJKQMLNCB2QY/events.json","paper":"https://pith.science/paper/BVUMBABH"},"agent_actions":{"view_html":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY","download_json":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY.json","view_paper":"https://pith.science/paper/BVUMBABH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04056&json=true","fetch_graph":"https://pith.science/api/pith-number/BVUMBABHKBMG5RRJKQMLNCB2QY/graph.json","fetch_events":"https://pith.science/api/pith-number/BVUMBABHKBMG5RRJKQMLNCB2QY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/action/storage_attestation","attest_author":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/action/author_attestation","sign_citation":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/action/citation_signature","submit_replication":"https://pith.science/pith/BVUMBABHKBMG5RRJKQMLNCB2QY/action/replication_record"}},"created_at":"2026-05-18T01:12:32.267273+00:00","updated_at":"2026-05-18T01:12:32.267273+00:00"}