{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C4HR4VPW2N4USC7TMNCIAOMTCR","short_pith_number":"pith:C4HR4VPW","schema_version":"1.0","canonical_sha256":"170f1e55f6d379490bf363448039931448749a187f875b8b5be6c52b093f8d79","source":{"kind":"arxiv","id":"1701.01781","version":1},"attestation_state":"computed","paper":{"title":"Bar code for monomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michela Ceria","submitted_at":"2017-01-07T00:34:27Z","abstract_excerpt":"Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial.\n  To do so, we define the Bar Code, a bidimensional structure representing any finite set of terms $M$ and allowing to desume many properties of the corresponding monomial ideal $I$, if $M$ is an order ideal. Then, we use it to give a connection between (strongly) stable monomial ideals and integer partitions, thus allowing to count them via known determinantal formulas."},"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":"1701.01781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-07T00:34:27Z","cross_cats_sorted":[],"title_canon_sha256":"e399324d2d13ea3d5ba74a94e4af3094bd8d16cd057e4545f57abdfec6997135","abstract_canon_sha256":"8a44d5f3de059304b80bfa7cacad8ffda5f51b7e16cbfc8f8c8aa90e25478c11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:15.126168Z","signature_b64":"Qzn71maihYnrYdXOjM7ueE3koeVlNhoB/Mi7bJ+Eg75PRru5K6EE4dnlDiWog7FELja/07JNImbE089ncO1nCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"170f1e55f6d379490bf363448039931448749a187f875b8b5be6c52b093f8d79","last_reissued_at":"2026-05-18T00:53:15.125804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:15.125804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bar code for monomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michela Ceria","submitted_at":"2017-01-07T00:34:27Z","abstract_excerpt":"Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial.\n  To do so, we define the Bar Code, a bidimensional structure representing any finite set of terms $M$ and allowing to desume many properties of the corresponding monomial ideal $I$, if $M$ is an order ideal. Then, we use it to give a connection between (strongly) stable monomial ideals and integer partitions, thus allowing to count them via known determinantal formulas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01781","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":"1701.01781","created_at":"2026-05-18T00:53:15.125861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01781v1","created_at":"2026-05-18T00:53:15.125861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01781","created_at":"2026-05-18T00:53:15.125861+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4HR4VPW2N4U","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4HR4VPW2N4USC7T","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4HR4VPW","created_at":"2026-05-18T12:31:08.081275+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/C4HR4VPW2N4USC7TMNCIAOMTCR","json":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR.json","graph_json":"https://pith.science/api/pith-number/C4HR4VPW2N4USC7TMNCIAOMTCR/graph.json","events_json":"https://pith.science/api/pith-number/C4HR4VPW2N4USC7TMNCIAOMTCR/events.json","paper":"https://pith.science/paper/C4HR4VPW"},"agent_actions":{"view_html":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR","download_json":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR.json","view_paper":"https://pith.science/paper/C4HR4VPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01781&json=true","fetch_graph":"https://pith.science/api/pith-number/C4HR4VPW2N4USC7TMNCIAOMTCR/graph.json","fetch_events":"https://pith.science/api/pith-number/C4HR4VPW2N4USC7TMNCIAOMTCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR/action/storage_attestation","attest_author":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR/action/author_attestation","sign_citation":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR/action/citation_signature","submit_replication":"https://pith.science/pith/C4HR4VPW2N4USC7TMNCIAOMTCR/action/replication_record"}},"created_at":"2026-05-18T00:53:15.125861+00:00","updated_at":"2026-05-18T00:53:15.125861+00:00"}