{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IUJUBBGJQKOEGW374D5OM2QNBK","short_pith_number":"pith:IUJUBBGJ","schema_version":"1.0","canonical_sha256":"45134084c9829c435b7fe0fae66a0d0ab1c15d6011e9bb4b4ee31f92daee042c","source":{"kind":"arxiv","id":"1702.07672","version":1},"attestation_state":"computed","paper":{"title":"Counting bi-colored A'Campo forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"No\\'emie Combe, Vincent Jug\\'e","submitted_at":"2017-02-24T17:24:58Z","abstract_excerpt":"We give an efficient method of counting bi-colored A'Campo forests and provide a stratification criterion for the space of those graphs. We deduce an algorithm to count these forests in polynomial time, answering an open question of A'Campo."},"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":"1702.07672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-02-24T17:24:58Z","cross_cats_sorted":[],"title_canon_sha256":"daee1e17c4ab9f447d08500711596d84fb6c37ab590a4cb23339c2e77962eef5","abstract_canon_sha256":"a9e730a79d4e685bccd6e9fa7f4f3cc30577c79c9a60bf1e9325ceeb582037e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.549693Z","signature_b64":"5yaeZbMG2SjokrF57Qt7TOvfyLYRcZu0gl2wvvsANqIIyfXCoDgmsAuujjEgpvZf97EbLC2lYBGvMNsqY2f/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45134084c9829c435b7fe0fae66a0d0ab1c15d6011e9bb4b4ee31f92daee042c","last_reissued_at":"2026-05-18T00:50:02.549083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.549083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting bi-colored A'Campo forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"No\\'emie Combe, Vincent Jug\\'e","submitted_at":"2017-02-24T17:24:58Z","abstract_excerpt":"We give an efficient method of counting bi-colored A'Campo forests and provide a stratification criterion for the space of those graphs. We deduce an algorithm to count these forests in polynomial time, answering an open question of A'Campo."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07672","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":"1702.07672","created_at":"2026-05-18T00:50:02.549167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07672v1","created_at":"2026-05-18T00:50:02.549167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07672","created_at":"2026-05-18T00:50:02.549167+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUJUBBGJQKOE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUJUBBGJQKOEGW37","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUJUBBGJ","created_at":"2026-05-18T12:31:21.493067+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/IUJUBBGJQKOEGW374D5OM2QNBK","json":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK.json","graph_json":"https://pith.science/api/pith-number/IUJUBBGJQKOEGW374D5OM2QNBK/graph.json","events_json":"https://pith.science/api/pith-number/IUJUBBGJQKOEGW374D5OM2QNBK/events.json","paper":"https://pith.science/paper/IUJUBBGJ"},"agent_actions":{"view_html":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK","download_json":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK.json","view_paper":"https://pith.science/paper/IUJUBBGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07672&json=true","fetch_graph":"https://pith.science/api/pith-number/IUJUBBGJQKOEGW374D5OM2QNBK/graph.json","fetch_events":"https://pith.science/api/pith-number/IUJUBBGJQKOEGW374D5OM2QNBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK/action/storage_attestation","attest_author":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK/action/author_attestation","sign_citation":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK/action/citation_signature","submit_replication":"https://pith.science/pith/IUJUBBGJQKOEGW374D5OM2QNBK/action/replication_record"}},"created_at":"2026-05-18T00:50:02.549167+00:00","updated_at":"2026-05-18T00:50:02.549167+00:00"}