{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DLBMFQZ6EU7C3TCI72YXKMZFOE","short_pith_number":"pith:DLBMFQZ6","schema_version":"1.0","canonical_sha256":"1ac2c2c33e253e2dcc48feb17533257136c8e26973fc0d53a2d86c3f8773165c","source":{"kind":"arxiv","id":"2507.12244","version":1},"attestation_state":"computed","paper":{"title":"Which graph motif parameters count?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, Julian D\\\"orfler, Markus Bl\\\"aser, Radu Curticapean","submitted_at":"2025-07-16T13:55:16Z","abstract_excerpt":"For a fixed graph H, the function #IndSub(H,*) maps graphs G to the count of induced H-copies in G; this function obviously \"counts something\" in that it has a combinatorial interpretation. Linear combinations of such functions are called graph motif parameters and have recently received significant attention in counting complexity after a seminal paper by Curticapean, Dell and Marx (STOC'17). We show that, among linear combinations of functions #IndSub(H,*) involving only graphs H without isolated vertices, precisely those with positive integer coefficients maintain a combinatorial interpreta"},"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":"2507.12244","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-16T13:55:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0c013be229116c1fcc444da86c71e76d56b372cfea1bf37b6ab81ea145fa16a7","abstract_canon_sha256":"2a4666b4bb365db460aef34f45b303222f8b89381c94a30cde7a0c3034049199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:17.301543Z","signature_b64":"sALrastzqGDg//pKq9SGaEigSa31So9TasHnmfcOeS40sOXbmIOnbn064iaoS6tJm0I1CZrbmvp/1YXFwbRCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac2c2c33e253e2dcc48feb17533257136c8e26973fc0d53a2d86c3f8773165c","last_reissued_at":"2026-07-05T11:38:17.301138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:17.301138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which graph motif parameters count?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Ikenmeyer, Julian D\\\"orfler, Markus Bl\\\"aser, Radu Curticapean","submitted_at":"2025-07-16T13:55:16Z","abstract_excerpt":"For a fixed graph H, the function #IndSub(H,*) maps graphs G to the count of induced H-copies in G; this function obviously \"counts something\" in that it has a combinatorial interpretation. Linear combinations of such functions are called graph motif parameters and have recently received significant attention in counting complexity after a seminal paper by Curticapean, Dell and Marx (STOC'17). We show that, among linear combinations of functions #IndSub(H,*) involving only graphs H without isolated vertices, precisely those with positive integer coefficients maintain a combinatorial interpreta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12244","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.12244/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.12244","created_at":"2026-07-05T11:38:17.301193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12244v1","created_at":"2026-07-05T11:38:17.301193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12244","created_at":"2026-07-05T11:38:17.301193+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLBMFQZ6EU7C","created_at":"2026-07-05T11:38:17.301193+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLBMFQZ6EU7C3TCI","created_at":"2026-07-05T11:38:17.301193+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLBMFQZ6","created_at":"2026-07-05T11:38:17.301193+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/DLBMFQZ6EU7C3TCI72YXKMZFOE","json":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE.json","graph_json":"https://pith.science/api/pith-number/DLBMFQZ6EU7C3TCI72YXKMZFOE/graph.json","events_json":"https://pith.science/api/pith-number/DLBMFQZ6EU7C3TCI72YXKMZFOE/events.json","paper":"https://pith.science/paper/DLBMFQZ6"},"agent_actions":{"view_html":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE","download_json":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE.json","view_paper":"https://pith.science/paper/DLBMFQZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12244&json=true","fetch_graph":"https://pith.science/api/pith-number/DLBMFQZ6EU7C3TCI72YXKMZFOE/graph.json","fetch_events":"https://pith.science/api/pith-number/DLBMFQZ6EU7C3TCI72YXKMZFOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE/action/storage_attestation","attest_author":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE/action/author_attestation","sign_citation":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE/action/citation_signature","submit_replication":"https://pith.science/pith/DLBMFQZ6EU7C3TCI72YXKMZFOE/action/replication_record"}},"created_at":"2026-07-05T11:38:17.301193+00:00","updated_at":"2026-07-05T11:38:17.301193+00:00"}